./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.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 2eef4809e0fb5b801f2479dfde07a6f5e1ac3784201f878d167f0654e03bdeae --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 10:51:39,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 10:51:39,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 10:51:39,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 10:51:39,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 10:51:39,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 10:51:39,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 10:51:39,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 10:51:39,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 10:51:39,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 10:51:39,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 10:51:39,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 10:51:39,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 10:51:39,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 10:51:39,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 10:51:39,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 10:51:39,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 10:51:39,262 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 10:51:39,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 10:51:39,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 10:51:39,268 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 10:51:39,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 10:51:39,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 10:51:39,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 10:51:39,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 10:51:39,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 10:51:39,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 10:51:39,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 10:51:39,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 10:51:39,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 10:51:39,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 10:51:39,281 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 10:51:39,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 10:51:39,283 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 10:51:39,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 10:51:39,284 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 10:51:39,284 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 10:51:39,285 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 10:51:39,285 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 10:51:39,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 10:51:39,286 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 10:51:39,287 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 10:51:39,288 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 10:51:39,307 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 10:51:39,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 10:51:39,308 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 10:51:39,308 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 10:51:39,309 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 10:51:39,309 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 10:51:39,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 10:51:39,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 10:51:39,310 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 10:51:39,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 10:51:39,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 10:51:39,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 10:51:39,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 10:51:39,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 10:51:39,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 10:51:39,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 10:51:39,312 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 10:51:39,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 10:51:39,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 10:51:39,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 10:51:39,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 10:51:39,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:51:39,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 10:51:39,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 10:51:39,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 10:51:39,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 10:51:39,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 10:51:39,314 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 10:51:39,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 10:51:39,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 10:51:39,314 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 -> 2eef4809e0fb5b801f2479dfde07a6f5e1ac3784201f878d167f0654e03bdeae [2022-07-21 10:51:39,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 10:51:39,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 10:51:39,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 10:51:39,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 10:51:39,664 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 10:51:39,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-07-21 10:51:39,727 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474ce5b1b/bf19aa5ec36f4a198553bfff77045fe5/FLAG055c0c076 [2022-07-21 10:51:40,486 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 10:51:40,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-07-21 10:51:40,519 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474ce5b1b/bf19aa5ec36f4a198553bfff77045fe5/FLAG055c0c076 [2022-07-21 10:51:40,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/474ce5b1b/bf19aa5ec36f4a198553bfff77045fe5 [2022-07-21 10:51:40,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 10:51:40,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 10:51:40,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 10:51:40,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 10:51:40,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 10:51:40,755 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:51:40" (1/1) ... [2022-07-21 10:51:40,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@763cb878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:40, skipping insertion in model container [2022-07-21 10:51:40,756 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 10:51:40" (1/1) ... [2022-07-21 10:51:40,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 10:51:40,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 10:51:42,562 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-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i[269371,269384] [2022-07-21 10:51:42,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:51:42,699 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 10:51:43,097 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-consumption/linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i[269371,269384] [2022-07-21 10:51:43,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 10:51:43,259 INFO L208 MainTranslator]: Completed translation [2022-07-21 10:51:43,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43 WrapperNode [2022-07-21 10:51:43,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 10:51:43,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 10:51:43,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 10:51:43,262 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 10:51:43,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:43,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:43,786 INFO L137 Inliner]: procedures = 282, calls = 3066, calls flagged for inlining = 129, calls inlined = 120, statements flattened = 6882 [2022-07-21 10:51:43,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 10:51:43,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 10:51:43,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 10:51:43,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 10:51:43,796 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:43,796 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:43,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:43,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:44,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:44,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:44,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:44,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 10:51:44,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 10:51:44,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 10:51:44,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 10:51:44,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (1/1) ... [2022-07-21 10:51:44,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 10:51:44,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:51:44,322 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 10:51:44,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 10:51:44,363 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2022-07-21 10:51:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure cdev_del [2022-07-21 10:51:44,364 INFO L138 BoogieDeclarations]: Found implementation of procedure cdev_del [2022-07-21 10:51:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 10:51:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 10:51:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure driver_remove_file [2022-07-21 10:51:44,364 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_remove_file [2022-07-21 10:51:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure find_partition [2022-07-21 10:51:44,365 INFO L138 BoogieDeclarations]: Found implementation of procedure find_partition [2022-07-21 10:51:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure lowmem_page_address [2022-07-21 10:51:44,365 INFO L138 BoogieDeclarations]: Found implementation of procedure lowmem_page_address [2022-07-21 10:51:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_block_when_processing_errors [2022-07-21 10:51:44,365 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_block_when_processing_errors [2022-07-21 10:51:44,365 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2022-07-21 10:51:44,365 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2022-07-21 10:51:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-21 10:51:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-21 10:51:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 10:51:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 10:51:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure class_unregister [2022-07-21 10:51:44,366 INFO L138 BoogieDeclarations]: Found implementation of procedure class_unregister [2022-07-21 10:51:44,366 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-21 10:51:44,367 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-21 10:51:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-21 10:51:44,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-21 10:51:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure tape_name [2022-07-21 10:51:44,367 INFO L138 BoogieDeclarations]: Found implementation of procedure tape_name [2022-07-21 10:51:44,367 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-21 10:51:44,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-21 10:51:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 10:51:44,368 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 10:51:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure st_int_ioctl [2022-07-21 10:51:44,368 INFO L138 BoogieDeclarations]: Found implementation of procedure st_int_ioctl [2022-07-21 10:51:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_rq_timeout [2022-07-21 10:51:44,368 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_rq_timeout [2022-07-21 10:51:44,368 INFO L130 BoogieDeclarations]: Found specification of procedure set_mode_densblk [2022-07-21 10:51:44,369 INFO L138 BoogieDeclarations]: Found implementation of procedure set_mode_densblk [2022-07-21 10:51:44,369 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2022-07-21 10:51:44,369 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2022-07-21 10:51:44,369 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_ioctl [2022-07-21 10:51:44,370 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_ioctl [2022-07-21 10:51:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 10:51:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_st_ref_mutex [2022-07-21 10:51:44,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_st_ref_mutex [2022-07-21 10:51:44,370 INFO L130 BoogieDeclarations]: Found specification of procedure read_mode_page [2022-07-21 10:51:44,370 INFO L138 BoogieDeclarations]: Found implementation of procedure read_mode_page [2022-07-21 10:51:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure do_door_lock [2022-07-21 10:51:44,371 INFO L138 BoogieDeclarations]: Found implementation of procedure do_door_lock [2022-07-21 10:51:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 10:51:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure put_page [2022-07-21 10:51:44,371 INFO L138 BoogieDeclarations]: Found implementation of procedure put_page [2022-07-21 10:51:44,371 INFO L130 BoogieDeclarations]: Found specification of procedure st_do_scsi [2022-07-21 10:51:44,371 INFO L138 BoogieDeclarations]: Found implementation of procedure st_do_scsi [2022-07-21 10:51:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure __xadd_wrong_size [2022-07-21 10:51:44,372 INFO L130 BoogieDeclarations]: Found specification of procedure signal_pending [2022-07-21 10:51:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure signal_pending [2022-07-21 10:51:44,373 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2022-07-21 10:51:44,373 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2022-07-21 10:51:44,373 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2022-07-21 10:51:44,374 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_unregister [2022-07-21 10:51:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 10:51:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure st_release_request [2022-07-21 10:51:44,374 INFO L138 BoogieDeclarations]: Found implementation of procedure st_release_request [2022-07-21 10:51:44,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 10:51:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure remove_cdevs [2022-07-21 10:51:44,375 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_cdevs [2022-07-21 10:51:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 10:51:44,375 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 10:51:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-21 10:51:44,375 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-21 10:51:44,375 INFO L130 BoogieDeclarations]: Found specification of procedure get_location [2022-07-21 10:51:44,376 INFO L138 BoogieDeclarations]: Found implementation of procedure get_location [2022-07-21 10:51:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure st_compression [2022-07-21 10:51:44,376 INFO L138 BoogieDeclarations]: Found implementation of procedure st_compression [2022-07-21 10:51:44,376 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_autopm_put_device [2022-07-21 10:51:44,377 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_autopm_put_device [2022-07-21 10:51:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev_region [2022-07-21 10:51:44,377 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev_region [2022-07-21 10:51:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 10:51:44,377 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 10:51:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 10:51:44,377 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 10:51:44,377 INFO L130 BoogieDeclarations]: Found specification of procedure check_tape [2022-07-21 10:51:44,378 INFO L138 BoogieDeclarations]: Found implementation of procedure check_tape [2022-07-21 10:51:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-21 10:51:44,378 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-21 10:51:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2022-07-21 10:51:44,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2022-07-21 10:51:44,378 INFO L130 BoogieDeclarations]: Found specification of procedure switch_partition [2022-07-21 10:51:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure switch_partition [2022-07-21 10:51:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock_of_scsi_tape [2022-07-21 10:51:44,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock_of_scsi_tape [2022-07-21 10:51:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 10:51:44,379 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-21 10:51:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-21 10:51:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure setup_buffering [2022-07-21 10:51:44,380 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_buffering [2022-07-21 10:51:44,380 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-21 10:51:44,381 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-21 10:51:44,381 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_tape_put [2022-07-21 10:51:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_tape_put [2022-07-21 10:51:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 10:51:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_cmd_ioctl [2022-07-21 10:51:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_cmd_ioctl [2022-07-21 10:51:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 10:51:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure create_one_cdev [2022-07-21 10:51:44,382 INFO L138 BoogieDeclarations]: Found implementation of procedure create_one_cdev [2022-07-21 10:51:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure queue_dma_alignment [2022-07-21 10:51:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_dma_alignment [2022-07-21 10:51:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure do_load_unload [2022-07-21 10:51:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure do_load_unload [2022-07-21 10:51:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure st_flush_write_buffer [2022-07-21 10:51:44,383 INFO L138 BoogieDeclarations]: Found implementation of procedure st_flush_write_buffer [2022-07-21 10:51:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 10:51:44,384 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 10:51:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure enlarge_buffer [2022-07-21 10:51:44,384 INFO L138 BoogieDeclarations]: Found implementation of procedure enlarge_buffer [2022-07-21 10:51:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure cross_eof [2022-07-21 10:51:44,385 INFO L138 BoogieDeclarations]: Found implementation of procedure cross_eof [2022-07-21 10:51:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure st_chk_result [2022-07-21 10:51:44,387 INFO L138 BoogieDeclarations]: Found implementation of procedure st_chk_result [2022-07-21 10:51:44,387 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2022-07-21 10:51:44,387 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2022-07-21 10:51:44,388 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 10:51:44,389 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 10:51:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure write_behind_check [2022-07-21 10:51:44,389 INFO L138 BoogieDeclarations]: Found implementation of procedure write_behind_check [2022-07-21 10:51:44,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 10:51:44,394 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-21 10:51:44,394 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-21 10:51:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-21 10:51:44,395 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-21 10:51:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 10:51:44,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 10:51:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_st_ref_mutex [2022-07-21 10:51:44,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_st_ref_mutex [2022-07-21 10:51:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 10:51:44,395 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-21 10:51:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-21 10:51:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 10:51:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure flush_buffer [2022-07-21 10:51:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_buffer [2022-07-21 10:51:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion [2022-07-21 10:51:44,396 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion [2022-07-21 10:51:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 10:51:44,396 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 10:51:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure driver_create_file [2022-07-21 10:51:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_create_file [2022-07-21 10:51:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure release_buffering [2022-07-21 10:51:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure release_buffering [2022-07-21 10:51:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2022-07-21 10:51:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2022-07-21 10:51:44,397 INFO L130 BoogieDeclarations]: Found specification of procedure normalize_buffer [2022-07-21 10:51:44,397 INFO L138 BoogieDeclarations]: Found implementation of procedure normalize_buffer [2022-07-21 10:51:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure write_mode_page [2022-07-21 10:51:44,398 INFO L138 BoogieDeclarations]: Found implementation of procedure write_mode_page [2022-07-21 10:51:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 10:51:44,398 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 10:51:44,398 INFO L130 BoogieDeclarations]: Found specification of procedure rw_checks [2022-07-21 10:51:44,398 INFO L138 BoogieDeclarations]: Found implementation of procedure rw_checks [2022-07-21 10:51:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-21 10:51:44,399 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-21 10:51:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure idr_remove [2022-07-21 10:51:44,399 INFO L138 BoogieDeclarations]: Found implementation of procedure idr_remove [2022-07-21 10:51:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock_of_scsi_tape [2022-07-21 10:51:44,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock_of_scsi_tape [2022-07-21 10:51:44,399 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-21 10:51:44,399 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-21 10:51:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 10:51:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_autopm_get_device [2022-07-21 10:51:44,400 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_autopm_get_device [2022-07-21 10:51:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure set_location [2022-07-21 10:51:44,400 INFO L138 BoogieDeclarations]: Found implementation of procedure set_location [2022-07-21 10:51:44,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 10:51:44,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 10:51:45,216 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 10:51:45,244 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 10:51:52,641 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 10:51:52,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 10:51:52,671 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 10:51:52,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:51:52 BoogieIcfgContainer [2022-07-21 10:51:52,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 10:51:52,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 10:51:52,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 10:51:52,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 10:51:52,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 10:51:40" (1/3) ... [2022-07-21 10:51:52,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1137d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:51:52, skipping insertion in model container [2022-07-21 10:51:52,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 10:51:43" (2/3) ... [2022-07-21 10:51:52,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1137d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 10:51:52, skipping insertion in model container [2022-07-21 10:51:52,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 10:51:52" (3/3) ... [2022-07-21 10:51:52,685 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.8-rc1-32_7a-drivers--scsi--st.ko-ldv_main0.cil.out.i [2022-07-21 10:51:52,699 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 10:51:52,699 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 10:51:52,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 10:51:52,819 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@5e99e596, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2613a727 [2022-07-21 10:51:52,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 10:51:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand has 2182 states, 1757 states have (on average 1.5054069436539557) internal successors, (2645), 1779 states have internal predecessors, (2645), 345 states have call successors, (345), 78 states have call predecessors, (345), 78 states have return successors, (345), 345 states have call predecessors, (345), 345 states have call successors, (345) [2022-07-21 10:51:52,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 10:51:52,841 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:51:52,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:51:52,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:51:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:51:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash 426041223, now seen corresponding path program 1 times [2022-07-21 10:51:52,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:51:52,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254337768] [2022-07-21 10:51:52,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:51:52,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:51:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:53,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:51:53,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 10:51:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:51:53,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254337768] [2022-07-21 10:51:53,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254337768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:51:53,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:51:53,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 10:51:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409727434] [2022-07-21 10:51:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:51:53,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 10:51:53,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:51:53,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 10:51:53,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:53,457 INFO L87 Difference]: Start difference. First operand has 2182 states, 1757 states have (on average 1.5054069436539557) internal successors, (2645), 1779 states have internal predecessors, (2645), 345 states have call successors, (345), 78 states have call predecessors, (345), 78 states have return successors, (345), 345 states have call predecessors, (345), 345 states have call successors, (345) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:51:53,701 INFO L93 Difference]: Finished difference Result 4356 states and 6772 transitions. [2022-07-21 10:51:53,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 10:51:53,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-21 10:51:53,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:51:53,736 INFO L225 Difference]: With dead ends: 4356 [2022-07-21 10:51:53,736 INFO L226 Difference]: Without dead ends: 2176 [2022-07-21 10:51:53,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:53,760 INFO L413 NwaCegarLoop]: 3295 mSDtfsCounter, 3291 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3291 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:51:53,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3291 Valid, 3295 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 10:51:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2022-07-21 10:51:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2022-07-21 10:51:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1753 states have (on average 1.488876212207644) internal successors, (2610), 1773 states have internal predecessors, (2610), 345 states have call successors, (345), 78 states have call predecessors, (345), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-07-21 10:51:53,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3292 transitions. [2022-07-21 10:51:53,944 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3292 transitions. Word has length 18 [2022-07-21 10:51:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:51:53,946 INFO L495 AbstractCegarLoop]: Abstraction has 2176 states and 3292 transitions. [2022-07-21 10:51:53,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3292 transitions. [2022-07-21 10:51:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 10:51:53,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:51:53,948 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:51:53,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 10:51:53,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:51:53,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:51:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1127105801, now seen corresponding path program 1 times [2022-07-21 10:51:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:51:53,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917539279] [2022-07-21 10:51:53,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:51:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:51:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:54,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:51:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 10:51:54,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:51:54,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917539279] [2022-07-21 10:51:54,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917539279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:51:54,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:51:54,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 10:51:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302787262] [2022-07-21 10:51:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:51:54,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 10:51:54,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:51:54,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 10:51:54,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:54,186 INFO L87 Difference]: Start difference. First operand 2176 states and 3292 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:54,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:51:54,282 INFO L93 Difference]: Finished difference Result 4345 states and 6575 transitions. [2022-07-21 10:51:54,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 10:51:54,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-21 10:51:54,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:51:54,300 INFO L225 Difference]: With dead ends: 4345 [2022-07-21 10:51:54,301 INFO L226 Difference]: Without dead ends: 2176 [2022-07-21 10:51:54,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:54,313 INFO L413 NwaCegarLoop]: 3290 mSDtfsCounter, 3285 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3285 SdHoareTripleChecker+Valid, 3290 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:51:54,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3285 Valid, 3290 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 10:51:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2022-07-21 10:51:54,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2176. [2022-07-21 10:51:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 1753 states have (on average 1.4883057615516257) internal successors, (2609), 1773 states have internal predecessors, (2609), 345 states have call successors, (345), 78 states have call predecessors, (345), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-07-21 10:51:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 3291 transitions. [2022-07-21 10:51:54,403 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 3291 transitions. Word has length 18 [2022-07-21 10:51:54,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:51:54,404 INFO L495 AbstractCegarLoop]: Abstraction has 2176 states and 3291 transitions. [2022-07-21 10:51:54,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:54,404 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 3291 transitions. [2022-07-21 10:51:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 10:51:54,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:51:54,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:51:54,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 10:51:54,406 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:51:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:51:54,406 INFO L85 PathProgramCache]: Analyzing trace with hash 734078791, now seen corresponding path program 1 times [2022-07-21 10:51:54,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:51:54,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809510062] [2022-07-21 10:51:54,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:51:54,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:51:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:54,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:51:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 10:51:54,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:51:54,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809510062] [2022-07-21 10:51:54,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809510062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:51:54,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:51:54,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 10:51:54,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762428658] [2022-07-21 10:51:54,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:51:54,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 10:51:54,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:51:54,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 10:51:54,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:54,558 INFO L87 Difference]: Start difference. First operand 2176 states and 3291 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:51:54,653 INFO L93 Difference]: Finished difference Result 2178 states and 3292 transitions. [2022-07-21 10:51:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 10:51:54,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-21 10:51:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:51:54,668 INFO L225 Difference]: With dead ends: 2178 [2022-07-21 10:51:54,668 INFO L226 Difference]: Without dead ends: 2175 [2022-07-21 10:51:54,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:54,671 INFO L413 NwaCegarLoop]: 3288 mSDtfsCounter, 3276 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3276 SdHoareTripleChecker+Valid, 3288 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:51:54,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3276 Valid, 3288 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 10:51:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2022-07-21 10:51:54,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 2175. [2022-07-21 10:51:54,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 1753 states have (on average 1.4877353108956075) internal successors, (2608), 1772 states have internal predecessors, (2608), 344 states have call successors, (344), 78 states have call predecessors, (344), 77 states have return successors, (337), 337 states have call predecessors, (337), 337 states have call successors, (337) [2022-07-21 10:51:54,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3289 transitions. [2022-07-21 10:51:54,757 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3289 transitions. Word has length 18 [2022-07-21 10:51:54,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:51:54,758 INFO L495 AbstractCegarLoop]: Abstraction has 2175 states and 3289 transitions. [2022-07-21 10:51:54,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:54,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3289 transitions. [2022-07-21 10:51:54,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-21 10:51:54,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:51:54,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:51:54,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 10:51:54,760 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:51:54,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:51:54,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1280897129, now seen corresponding path program 1 times [2022-07-21 10:51:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:51:54,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174141452] [2022-07-21 10:51:54,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:51:54,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:51:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:51:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 10:51:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:51:54,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174141452] [2022-07-21 10:51:54,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174141452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:51:54,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:51:54,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 10:51:54,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225767266] [2022-07-21 10:51:54,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:51:54,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 10:51:54,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:51:54,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 10:51:54,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:54,904 INFO L87 Difference]: Start difference. First operand 2175 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:51:55,111 INFO L93 Difference]: Finished difference Result 6401 states and 9695 transitions. [2022-07-21 10:51:55,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 10:51:55,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-21 10:51:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:51:55,142 INFO L225 Difference]: With dead ends: 6401 [2022-07-21 10:51:55,143 INFO L226 Difference]: Without dead ends: 4267 [2022-07-21 10:51:55,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:55,158 INFO L413 NwaCegarLoop]: 5401 mSDtfsCounter, 3271 mSDsluCounter, 3166 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3271 SdHoareTripleChecker+Valid, 8567 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 10:51:55,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3271 Valid, 8567 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 10:51:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2022-07-21 10:51:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4262. [2022-07-21 10:51:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4262 states, 3448 states have (on average 1.4895591647331787) internal successors, (5136), 3479 states have internal predecessors, (5136), 662 states have call successors, (662), 153 states have call predecessors, (662), 151 states have return successors, (657), 651 states have call predecessors, (657), 651 states have call successors, (657) [2022-07-21 10:51:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 6455 transitions. [2022-07-21 10:51:55,339 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 6455 transitions. Word has length 19 [2022-07-21 10:51:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:51:55,339 INFO L495 AbstractCegarLoop]: Abstraction has 4262 states and 6455 transitions. [2022-07-21 10:51:55,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 6455 transitions. [2022-07-21 10:51:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 10:51:55,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:51:55,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:51:55,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 10:51:55,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:51:55,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:51:55,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1052401290, now seen corresponding path program 1 times [2022-07-21 10:51:55,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:51:55,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390927170] [2022-07-21 10:51:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:51:55,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:51:55,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:55,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:51:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:55,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 10:51:55,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:51:55,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390927170] [2022-07-21 10:51:55,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390927170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:51:55,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:51:55,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 10:51:55,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413749062] [2022-07-21 10:51:55,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:51:55,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 10:51:55,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:51:55,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 10:51:55,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:55,462 INFO L87 Difference]: Start difference. First operand 4262 states and 6455 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:51:55,665 INFO L93 Difference]: Finished difference Result 4264 states and 6456 transitions. [2022-07-21 10:51:55,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 10:51:55,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-21 10:51:55,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:51:55,694 INFO L225 Difference]: With dead ends: 4264 [2022-07-21 10:51:55,694 INFO L226 Difference]: Without dead ends: 4261 [2022-07-21 10:51:55,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:55,699 INFO L413 NwaCegarLoop]: 3286 mSDtfsCounter, 3272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3272 SdHoareTripleChecker+Valid, 3286 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:51:55,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3272 Valid, 3286 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 10:51:55,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2022-07-21 10:51:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 4261. [2022-07-21 10:51:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4261 states, 3448 states have (on average 1.4892691415313226) internal successors, (5135), 3478 states have internal predecessors, (5135), 661 states have call successors, (661), 153 states have call predecessors, (661), 151 states have return successors, (657), 651 states have call predecessors, (657), 651 states have call successors, (657) [2022-07-21 10:51:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6453 transitions. [2022-07-21 10:51:55,863 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6453 transitions. Word has length 20 [2022-07-21 10:51:55,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:51:55,864 INFO L495 AbstractCegarLoop]: Abstraction has 4261 states and 6453 transitions. [2022-07-21 10:51:55,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:55,865 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6453 transitions. [2022-07-21 10:51:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 10:51:55,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:51:55,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:51:55,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 10:51:55,870 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:51:55,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:51:55,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1735997556, now seen corresponding path program 1 times [2022-07-21 10:51:55,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:51:55,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908334672] [2022-07-21 10:51:55,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:51:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:51:55,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:55,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:51:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:55,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 10:51:55,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:51:55,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908334672] [2022-07-21 10:51:55,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908334672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:51:55,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:51:55,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 10:51:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274950034] [2022-07-21 10:51:55,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:51:55,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 10:51:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:51:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 10:51:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:55,985 INFO L87 Difference]: Start difference. First operand 4261 states and 6453 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:51:56,126 INFO L93 Difference]: Finished difference Result 4333 states and 6511 transitions. [2022-07-21 10:51:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 10:51:56,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-21 10:51:56,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:51:56,154 INFO L225 Difference]: With dead ends: 4333 [2022-07-21 10:51:56,154 INFO L226 Difference]: Without dead ends: 4312 [2022-07-21 10:51:56,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 10:51:56,161 INFO L413 NwaCegarLoop]: 3288 mSDtfsCounter, 3107 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3107 SdHoareTripleChecker+Valid, 3473 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:51:56,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3107 Valid, 3473 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 10:51:56,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4312 states. [2022-07-21 10:51:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4312 to 4310. [2022-07-21 10:51:56,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 3491 states have (on average 1.4818103695216271) internal successors, (5173), 3519 states have internal predecessors, (5173), 651 states have call successors, (651), 169 states have call predecessors, (651), 167 states have return successors, (649), 643 states have call predecessors, (649), 643 states have call successors, (649) [2022-07-21 10:51:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 6473 transitions. [2022-07-21 10:51:56,316 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 6473 transitions. Word has length 21 [2022-07-21 10:51:56,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:51:56,317 INFO L495 AbstractCegarLoop]: Abstraction has 4310 states and 6473 transitions. [2022-07-21 10:51:56,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 10:51:56,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 6473 transitions. [2022-07-21 10:51:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 10:51:56,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:51:56,324 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 10:51:56,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 10:51:56,325 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:51:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:51:56,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1313551294, now seen corresponding path program 1 times [2022-07-21 10:51:56,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:51:56,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845995088] [2022-07-21 10:51:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:51:56,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:51:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:51:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 10:51:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 10:51:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:56,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:51:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:51:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 10:51:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:51:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 10:51:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:51:56,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845995088] [2022-07-21 10:51:56,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845995088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:51:56,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:51:56,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 10:51:56,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613012828] [2022-07-21 10:51:56,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:51:56,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 10:51:56,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:51:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 10:51:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 10:51:56,533 INFO L87 Difference]: Start difference. First operand 4310 states and 6473 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 10:52:01,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:01,090 INFO L93 Difference]: Finished difference Result 8570 states and 12881 transitions. [2022-07-21 10:52:01,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 10:52:01,091 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-07-21 10:52:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:01,128 INFO L225 Difference]: With dead ends: 8570 [2022-07-21 10:52:01,129 INFO L226 Difference]: Without dead ends: 4313 [2022-07-21 10:52:01,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:52:01,151 INFO L413 NwaCegarLoop]: 4180 mSDtfsCounter, 4705 mSDsluCounter, 3269 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 913 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5015 SdHoareTripleChecker+Valid, 7449 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 913 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:01,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5015 Valid, 7449 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [913 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 10:52:01,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2022-07-21 10:52:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4310. [2022-07-21 10:52:01,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4310 states, 3491 states have (on average 1.4812374677742768) internal successors, (5171), 3519 states have internal predecessors, (5171), 651 states have call successors, (651), 169 states have call predecessors, (651), 167 states have return successors, (643), 643 states have call predecessors, (643), 640 states have call successors, (643) [2022-07-21 10:52:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4310 states to 4310 states and 6465 transitions. [2022-07-21 10:52:01,318 INFO L78 Accepts]: Start accepts. Automaton has 4310 states and 6465 transitions. Word has length 61 [2022-07-21 10:52:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:01,320 INFO L495 AbstractCegarLoop]: Abstraction has 4310 states and 6465 transitions. [2022-07-21 10:52:01,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 10:52:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4310 states and 6465 transitions. [2022-07-21 10:52:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 10:52:01,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:01,324 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 10:52:01,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 10:52:01,324 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:01,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:01,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2136944131, now seen corresponding path program 1 times [2022-07-21 10:52:01,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:01,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492979961] [2022-07-21 10:52:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:01,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:52:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:01,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 10:52:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 10:52:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:01,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:52:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:01,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:52:01,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:01,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 10:52:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:01,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 10:52:01,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:01,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492979961] [2022-07-21 10:52:01,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492979961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:01,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:01,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 10:52:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203942915] [2022-07-21 10:52:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:01,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 10:52:01,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:01,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 10:52:01,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:52:01,592 INFO L87 Difference]: Start difference. First operand 4310 states and 6465 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 10:52:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:10,024 INFO L93 Difference]: Finished difference Result 6392 states and 9710 transitions. [2022-07-21 10:52:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:52:10,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2022-07-21 10:52:10,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:10,055 INFO L225 Difference]: With dead ends: 6392 [2022-07-21 10:52:10,056 INFO L226 Difference]: Without dead ends: 5310 [2022-07-21 10:52:10,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:52:10,067 INFO L413 NwaCegarLoop]: 4247 mSDtfsCounter, 2864 mSDsluCounter, 10609 mSDsCounter, 0 mSdLazyCounter, 7685 mSolverCounterSat, 634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3000 SdHoareTripleChecker+Valid, 14856 SdHoareTripleChecker+Invalid, 8319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 634 IncrementalHoareTripleChecker+Valid, 7685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:10,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3000 Valid, 14856 Invalid, 8319 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [634 Valid, 7685 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-21 10:52:10,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2022-07-21 10:52:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 3961. [2022-07-21 10:52:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3961 states, 3182 states have (on average 1.4685732243871779) internal successors, (4673), 3208 states have internal predecessors, (4673), 612 states have call successors, (612), 168 states have call predecessors, (612), 166 states have return successors, (606), 606 states have call predecessors, (606), 603 states have call successors, (606) [2022-07-21 10:52:10,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5891 transitions. [2022-07-21 10:52:10,305 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5891 transitions. Word has length 61 [2022-07-21 10:52:10,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:10,305 INFO L495 AbstractCegarLoop]: Abstraction has 3961 states and 5891 transitions. [2022-07-21 10:52:10,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-21 10:52:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5891 transitions. [2022-07-21 10:52:10,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 10:52:10,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:10,311 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 10:52:10,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 10:52:10,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:10,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:10,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1364454553, now seen corresponding path program 1 times [2022-07-21 10:52:10,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:10,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340307438] [2022-07-21 10:52:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:10,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:10,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:52:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 10:52:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-21 10:52:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-21 10:52:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:52:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:10,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:52:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 10:52:10,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:10,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340307438] [2022-07-21 10:52:10,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340307438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:10,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:10,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:52:10,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443219928] [2022-07-21 10:52:10,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:10,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:52:10,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:10,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:52:10,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:52:10,537 INFO L87 Difference]: Start difference. First operand 3961 states and 5891 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 10:52:15,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:52:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:19,784 INFO L93 Difference]: Finished difference Result 8987 states and 13565 transitions. [2022-07-21 10:52:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 10:52:19,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 63 [2022-07-21 10:52:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:19,815 INFO L225 Difference]: With dead ends: 8987 [2022-07-21 10:52:19,815 INFO L226 Difference]: Without dead ends: 5079 [2022-07-21 10:52:19,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 10:52:19,834 INFO L413 NwaCegarLoop]: 3152 mSDtfsCounter, 2631 mSDsluCounter, 3578 mSDsCounter, 0 mSdLazyCounter, 4227 mSolverCounterSat, 1056 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2925 SdHoareTripleChecker+Valid, 6730 SdHoareTripleChecker+Invalid, 5284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1056 IncrementalHoareTripleChecker+Valid, 4227 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:19,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2925 Valid, 6730 Invalid, 5284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1056 Valid, 4227 Invalid, 1 Unknown, 0 Unchecked, 8.8s Time] [2022-07-21 10:52:19,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5079 states. [2022-07-21 10:52:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5079 to 4784. [2022-07-21 10:52:20,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 3864 states have (on average 1.4754140786749483) internal successors, (5701), 3895 states have internal predecessors, (5701), 753 states have call successors, (753), 168 states have call predecessors, (753), 166 states have return successors, (748), 748 states have call predecessors, (748), 744 states have call successors, (748) [2022-07-21 10:52:20,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 7202 transitions. [2022-07-21 10:52:20,131 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 7202 transitions. Word has length 63 [2022-07-21 10:52:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:20,131 INFO L495 AbstractCegarLoop]: Abstraction has 4784 states and 7202 transitions. [2022-07-21 10:52:20,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 10:52:20,132 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 7202 transitions. [2022-07-21 10:52:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-21 10:52:20,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:20,135 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:52:20,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 10:52:20,136 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1555859730, now seen corresponding path program 1 times [2022-07-21 10:52:20,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:20,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487881952] [2022-07-21 10:52:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:52:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 10:52:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-21 10:52:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 10:52:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:52:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-21 10:52:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 10:52:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 10:52:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 10:52:20,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:20,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487881952] [2022-07-21 10:52:20,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487881952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:20,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:20,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 10:52:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898099479] [2022-07-21 10:52:20,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:20,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 10:52:20,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:20,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 10:52:20,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 10:52:20,359 INFO L87 Difference]: Start difference. First operand 4784 states and 7202 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 10:52:27,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:27,754 INFO L93 Difference]: Finished difference Result 8110 states and 12296 transitions. [2022-07-21 10:52:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:52:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2022-07-21 10:52:27,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:27,780 INFO L225 Difference]: With dead ends: 8110 [2022-07-21 10:52:27,781 INFO L226 Difference]: Without dead ends: 6592 [2022-07-21 10:52:27,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:52:27,794 INFO L413 NwaCegarLoop]: 4236 mSDtfsCounter, 3860 mSDsluCounter, 9569 mSDsCounter, 0 mSdLazyCounter, 7605 mSolverCounterSat, 726 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3996 SdHoareTripleChecker+Valid, 13805 SdHoareTripleChecker+Invalid, 8331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 726 IncrementalHoareTripleChecker+Valid, 7605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:27,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3996 Valid, 13805 Invalid, 8331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [726 Valid, 7605 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-07-21 10:52:27,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6592 states. [2022-07-21 10:52:27,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6592 to 4782. [2022-07-21 10:52:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4782 states, 3862 states have (on average 1.4751424132573796) internal successors, (5697), 3893 states have internal predecessors, (5697), 753 states have call successors, (753), 168 states have call predecessors, (753), 166 states have return successors, (748), 748 states have call predecessors, (748), 744 states have call successors, (748) [2022-07-21 10:52:28,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4782 states to 4782 states and 7198 transitions. [2022-07-21 10:52:28,010 INFO L78 Accepts]: Start accepts. Automaton has 4782 states and 7198 transitions. Word has length 78 [2022-07-21 10:52:28,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:28,011 INFO L495 AbstractCegarLoop]: Abstraction has 4782 states and 7198 transitions. [2022-07-21 10:52:28,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 10:52:28,012 INFO L276 IsEmpty]: Start isEmpty. Operand 4782 states and 7198 transitions. [2022-07-21 10:52:28,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-21 10:52:28,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:28,015 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 10:52:28,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 10:52:28,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:28,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:28,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1260357111, now seen corresponding path program 1 times [2022-07-21 10:52:28,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:28,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695582227] [2022-07-21 10:52:28,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:52:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 10:52:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-21 10:52:28,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:52:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:52:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 10:52:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-21 10:52:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-21 10:52:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 10:52:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:52:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:52:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 10:52:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:28,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695582227] [2022-07-21 10:52:28,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695582227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:28,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:28,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 10:52:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404554088] [2022-07-21 10:52:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:28,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 10:52:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 10:52:28,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 10:52:28,298 INFO L87 Difference]: Start difference. First operand 4782 states and 7198 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 10:52:33,006 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:52:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:39,786 INFO L93 Difference]: Finished difference Result 12026 states and 18584 transitions. [2022-07-21 10:52:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 10:52:39,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 82 [2022-07-21 10:52:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:39,826 INFO L225 Difference]: With dead ends: 12026 [2022-07-21 10:52:39,826 INFO L226 Difference]: Without dead ends: 7297 [2022-07-21 10:52:39,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:52:39,846 INFO L413 NwaCegarLoop]: 3816 mSDtfsCounter, 3734 mSDsluCounter, 6326 mSDsCounter, 0 mSdLazyCounter, 5986 mSolverCounterSat, 1620 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4085 SdHoareTripleChecker+Valid, 10142 SdHoareTripleChecker+Invalid, 7607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1620 IncrementalHoareTripleChecker+Valid, 5986 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:39,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4085 Valid, 10142 Invalid, 7607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1620 Valid, 5986 Invalid, 1 Unknown, 0 Unchecked, 11.0s Time] [2022-07-21 10:52:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7297 states. [2022-07-21 10:52:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7297 to 6511. [2022-07-21 10:52:40,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6511 states, 5310 states have (on average 1.4922787193973635) internal successors, (7924), 5340 states have internal predecessors, (7924), 1034 states have call successors, (1034), 168 states have call predecessors, (1034), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-07-21 10:52:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6511 states to 6511 states and 9991 transitions. [2022-07-21 10:52:40,159 INFO L78 Accepts]: Start accepts. Automaton has 6511 states and 9991 transitions. Word has length 82 [2022-07-21 10:52:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:40,159 INFO L495 AbstractCegarLoop]: Abstraction has 6511 states and 9991 transitions. [2022-07-21 10:52:40,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-21 10:52:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand 6511 states and 9991 transitions. [2022-07-21 10:52:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-21 10:52:40,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:40,165 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 10:52:40,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 10:52:40,166 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:40,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:40,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1025149567, now seen corresponding path program 1 times [2022-07-21 10:52:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:40,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142673939] [2022-07-21 10:52:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:52:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:52:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:52:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:52:40,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:52:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:52:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:52:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:52:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:52:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:52:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-21 10:52:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142673939] [2022-07-21 10:52:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142673939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:40,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:40,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 10:52:40,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226522052] [2022-07-21 10:52:40,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:40,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 10:52:40,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:40,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 10:52:40,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 10:52:40,490 INFO L87 Difference]: Start difference. First operand 6511 states and 9991 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 10:52:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:45,046 INFO L93 Difference]: Finished difference Result 6857 states and 10641 transitions. [2022-07-21 10:52:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 10:52:45,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 81 [2022-07-21 10:52:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:45,087 INFO L225 Difference]: With dead ends: 6857 [2022-07-21 10:52:45,087 INFO L226 Difference]: Without dead ends: 6854 [2022-07-21 10:52:45,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 10:52:45,097 INFO L413 NwaCegarLoop]: 3154 mSDtfsCounter, 2096 mSDsluCounter, 4118 mSDsCounter, 0 mSdLazyCounter, 3351 mSolverCounterSat, 896 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2207 SdHoareTripleChecker+Valid, 7272 SdHoareTripleChecker+Invalid, 4247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 896 IncrementalHoareTripleChecker+Valid, 3351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:45,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2207 Valid, 7272 Invalid, 4247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [896 Valid, 3351 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-21 10:52:45,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6854 states. [2022-07-21 10:52:45,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6854 to 6510. [2022-07-21 10:52:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6510 states, 5310 states have (on average 1.4919020715630884) internal successors, (7922), 5339 states have internal predecessors, (7922), 1033 states have call successors, (1033), 168 states have call predecessors, (1033), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-07-21 10:52:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6510 states to 6510 states and 9988 transitions. [2022-07-21 10:52:45,398 INFO L78 Accepts]: Start accepts. Automaton has 6510 states and 9988 transitions. Word has length 81 [2022-07-21 10:52:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:45,400 INFO L495 AbstractCegarLoop]: Abstraction has 6510 states and 9988 transitions. [2022-07-21 10:52:45,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 10:52:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 6510 states and 9988 transitions. [2022-07-21 10:52:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-21 10:52:45,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:45,417 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:52:45,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 10:52:45,418 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:45,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -506086540, now seen corresponding path program 1 times [2022-07-21 10:52:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:45,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345344481] [2022-07-21 10:52:45,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:45,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:52:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:52:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:52:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:52:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:52:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:52:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:52:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:52:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:52:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:52:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 10:52:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:52:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 10:52:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:52:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 10:52:45,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-21 10:52:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 10:52:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:52:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 10:52:45,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:45,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345344481] [2022-07-21 10:52:45,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345344481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:45,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:45,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 10:52:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097214729] [2022-07-21 10:52:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:45,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 10:52:45,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 10:52:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 10:52:45,700 INFO L87 Difference]: Start difference. First operand 6510 states and 9988 transitions. Second operand has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 10:52:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:52:53,668 INFO L93 Difference]: Finished difference Result 13459 states and 20861 transitions. [2022-07-21 10:52:53,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 10:52:53,669 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2022-07-21 10:52:53,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:52:53,704 INFO L225 Difference]: With dead ends: 13459 [2022-07-21 10:52:53,704 INFO L226 Difference]: Without dead ends: 6990 [2022-07-21 10:52:53,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-07-21 10:52:53,729 INFO L413 NwaCegarLoop]: 3069 mSDtfsCounter, 3896 mSDsluCounter, 7094 mSDsCounter, 0 mSdLazyCounter, 5787 mSolverCounterSat, 2094 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3898 SdHoareTripleChecker+Valid, 10163 SdHoareTripleChecker+Invalid, 7881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2094 IncrementalHoareTripleChecker+Valid, 5787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-21 10:52:53,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3898 Valid, 10163 Invalid, 7881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2094 Valid, 5787 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-21 10:52:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6990 states. [2022-07-21 10:52:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6990 to 6504. [2022-07-21 10:52:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6504 states, 5309 states have (on average 1.4912412883782256) internal successors, (7917), 5338 states have internal predecessors, (7917), 1028 states have call successors, (1028), 168 states have call predecessors, (1028), 166 states have return successors, (1028), 1028 states have call predecessors, (1028), 1020 states have call successors, (1028) [2022-07-21 10:52:54,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 9973 transitions. [2022-07-21 10:52:54,040 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 9973 transitions. Word has length 144 [2022-07-21 10:52:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:52:54,040 INFO L495 AbstractCegarLoop]: Abstraction has 6504 states and 9973 transitions. [2022-07-21 10:52:54,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.75) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (20), 6 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-21 10:52:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 9973 transitions. [2022-07-21 10:52:54,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2022-07-21 10:52:54,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:52:54,067 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:52:54,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 10:52:54,068 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:52:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:52:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1900050381, now seen corresponding path program 1 times [2022-07-21 10:52:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:52:54,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23223437] [2022-07-21 10:52:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:52:54,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:52:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:52:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:52:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:52:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:52:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:52:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:52:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:52:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:52:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:52:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:52:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 10:52:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:52:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:52:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:52:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 10:52:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 10:52:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:52:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-21 10:52:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 10:52:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 10:52:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-21 10:52:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:52:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:52:54,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 10:52:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:52:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:52:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-21 10:52:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-21 10:52:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-21 10:52:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-21 10:52:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-07-21 10:52:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 10:52:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 10:52:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:52:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:52:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-21 10:52:54,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:52:54,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23223437] [2022-07-21 10:52:54,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23223437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:52:54,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:52:54,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 10:52:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426933288] [2022-07-21 10:52:54,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:52:54,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 10:52:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:52:54,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 10:52:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 10:52:54,630 INFO L87 Difference]: Start difference. First operand 6504 states and 9973 transitions. Second operand has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-07-21 10:53:00,285 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:53:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:07,423 INFO L93 Difference]: Finished difference Result 13716 states and 21377 transitions. [2022-07-21 10:53:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 10:53:07,424 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 239 [2022-07-21 10:53:07,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:07,467 INFO L225 Difference]: With dead ends: 13716 [2022-07-21 10:53:07,467 INFO L226 Difference]: Without dead ends: 7235 [2022-07-21 10:53:07,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2022-07-21 10:53:07,492 INFO L413 NwaCegarLoop]: 3031 mSDtfsCounter, 4753 mSDsluCounter, 9441 mSDsCounter, 0 mSdLazyCounter, 9908 mSolverCounterSat, 2710 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4790 SdHoareTripleChecker+Valid, 12472 SdHoareTripleChecker+Invalid, 12619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2710 IncrementalHoareTripleChecker+Valid, 9908 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:07,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4790 Valid, 12472 Invalid, 12619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2710 Valid, 9908 Invalid, 1 Unknown, 0 Unchecked, 12.3s Time] [2022-07-21 10:53:07,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7235 states. [2022-07-21 10:53:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7235 to 6512. [2022-07-21 10:53:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 5312 states have (on average 1.4890813253012047) internal successors, (7910), 5341 states have internal predecessors, (7910), 1033 states have call successors, (1033), 168 states have call predecessors, (1033), 166 states have return successors, (1033), 1033 states have call predecessors, (1033), 1025 states have call successors, (1033) [2022-07-21 10:53:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 9976 transitions. [2022-07-21 10:53:07,859 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 9976 transitions. Word has length 239 [2022-07-21 10:53:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:07,860 INFO L495 AbstractCegarLoop]: Abstraction has 6512 states and 9976 transitions. [2022-07-21 10:53:07,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 11.416666666666666) internal successors, (137), 5 states have internal predecessors, (137), 4 states have call successors, (36), 9 states have call predecessors, (36), 1 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-07-21 10:53:07,861 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 9976 transitions. [2022-07-21 10:53:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-21 10:53:07,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:07,882 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:53:07,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 10:53:07,882 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:07,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1106676286, now seen corresponding path program 1 times [2022-07-21 10:53:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:07,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651138082] [2022-07-21 10:53:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:53:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:53:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:53:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 10:53:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 10:53:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-21 10:53:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 10:53:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-21 10:53:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 10:53:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 10:53:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-21 10:53:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-21 10:53:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 10:53:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 10:53:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 10:53:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 10:53:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 10:53:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 10:53:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 10:53:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 10:53:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 10:53:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:53:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 10:53:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 10:53:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:53:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-21 10:53:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-21 10:53:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 10:53:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-21 10:53:08,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-21 10:53:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:08,322 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-21 10:53:08,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:08,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651138082] [2022-07-21 10:53:08,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651138082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:53:08,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:53:08,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 10:53:08,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749548755] [2022-07-21 10:53:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:53:08,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 10:53:08,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:08,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 10:53:08,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-07-21 10:53:08,324 INFO L87 Difference]: Start difference. First operand 6512 states and 9976 transitions. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 6 states have internal predecessors, (165), 4 states have call successors, (36), 9 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-07-21 10:53:15,881 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:53:17,921 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-21 10:53:29,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:29,519 INFO L93 Difference]: Finished difference Result 13890 states and 21920 transitions. [2022-07-21 10:53:29,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 10:53:29,520 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 6 states have internal predecessors, (165), 4 states have call successors, (36), 9 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 263 [2022-07-21 10:53:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:29,559 INFO L225 Difference]: With dead ends: 13890 [2022-07-21 10:53:29,559 INFO L226 Difference]: Without dead ends: 7394 [2022-07-21 10:53:29,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=528, Unknown=0, NotChecked=0, Total=702 [2022-07-21 10:53:29,586 INFO L413 NwaCegarLoop]: 3047 mSDtfsCounter, 4467 mSDsluCounter, 11930 mSDsCounter, 0 mSdLazyCounter, 13552 mSolverCounterSat, 2469 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4469 SdHoareTripleChecker+Valid, 14977 SdHoareTripleChecker+Invalid, 16023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2469 IncrementalHoareTripleChecker+Valid, 13552 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:29,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4469 Valid, 14977 Invalid, 16023 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2469 Valid, 13552 Invalid, 2 Unknown, 0 Unchecked, 20.4s Time] [2022-07-21 10:53:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2022-07-21 10:53:29,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 6576. [2022-07-21 10:53:29,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6576 states, 5375 states have (on average 1.4852093023255815) internal successors, (7983), 5397 states have internal predecessors, (7983), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 167 states have return successors, (1036), 1033 states have call predecessors, (1036), 1025 states have call successors, (1036) [2022-07-21 10:53:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6576 states to 6576 states and 10052 transitions. [2022-07-21 10:53:29,903 INFO L78 Accepts]: Start accepts. Automaton has 6576 states and 10052 transitions. Word has length 263 [2022-07-21 10:53:29,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:29,904 INFO L495 AbstractCegarLoop]: Abstraction has 6576 states and 10052 transitions. [2022-07-21 10:53:29,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 6 states have internal predecessors, (165), 4 states have call successors, (36), 9 states have call predecessors, (36), 3 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2022-07-21 10:53:29,904 INFO L276 IsEmpty]: Start isEmpty. Operand 6576 states and 10052 transitions. [2022-07-21 10:53:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-21 10:53:29,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:29,926 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:53:29,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 10:53:29,927 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:29,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2009801004, now seen corresponding path program 1 times [2022-07-21 10:53:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:29,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814892644] [2022-07-21 10:53:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:30,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:53:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:53:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:53:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:53:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:53:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:53:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:53:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:53:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:53:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:53:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 10:53:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:53:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:53:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:53:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 10:53:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 10:53:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:53:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 10:53:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 10:53:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 10:53:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:53:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 10:53:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 10:53:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:53:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 10:53:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-21 10:53:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 10:53:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-21 10:53:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 10:53:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:30,466 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-21 10:53:30,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:30,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814892644] [2022-07-21 10:53:30,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814892644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:53:30,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:53:30,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 10:53:30,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403710] [2022-07-21 10:53:30,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:53:30,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 10:53:30,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:30,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 10:53:30,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-21 10:53:30,470 INFO L87 Difference]: Start difference. First operand 6576 states and 10052 transitions. Second operand has 10 states, 10 states have (on average 16.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-21 10:53:35,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:53:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:40,965 INFO L93 Difference]: Finished difference Result 13892 states and 21612 transitions. [2022-07-21 10:53:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 10:53:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 249 [2022-07-21 10:53:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:40,999 INFO L225 Difference]: With dead ends: 13892 [2022-07-21 10:53:40,999 INFO L226 Difference]: Without dead ends: 7369 [2022-07-21 10:53:41,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2022-07-21 10:53:41,026 INFO L413 NwaCegarLoop]: 3010 mSDtfsCounter, 5166 mSDsluCounter, 6392 mSDsCounter, 0 mSdLazyCounter, 5863 mSolverCounterSat, 3101 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5168 SdHoareTripleChecker+Valid, 9402 SdHoareTripleChecker+Invalid, 8965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3101 IncrementalHoareTripleChecker+Valid, 5863 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:41,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5168 Valid, 9402 Invalid, 8965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3101 Valid, 5863 Invalid, 1 Unknown, 0 Unchecked, 10.0s Time] [2022-07-21 10:53:41,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7369 states. [2022-07-21 10:53:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7369 to 6580. [2022-07-21 10:53:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6580 states, 5379 states have (on average 1.4848484848484849) internal successors, (7987), 5401 states have internal predecessors, (7987), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 167 states have return successors, (1036), 1033 states have call predecessors, (1036), 1025 states have call successors, (1036) [2022-07-21 10:53:41,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6580 states to 6580 states and 10056 transitions. [2022-07-21 10:53:41,385 INFO L78 Accepts]: Start accepts. Automaton has 6580 states and 10056 transitions. Word has length 249 [2022-07-21 10:53:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:41,385 INFO L495 AbstractCegarLoop]: Abstraction has 6580 states and 10056 transitions. [2022-07-21 10:53:41,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.0) internal successors, (160), 3 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-21 10:53:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 6580 states and 10056 transitions. [2022-07-21 10:53:41,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-21 10:53:41,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:41,409 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:53:41,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 10:53:41,409 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:41,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:41,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1493708136, now seen corresponding path program 1 times [2022-07-21 10:53:41,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:41,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036111803] [2022-07-21 10:53:41,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:41,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:53:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:53:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:53:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:53:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:53:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:53:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:53:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:53:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:53:41,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:53:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 10:53:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:53:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:53:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:53:41,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 10:53:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 10:53:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:53:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 10:53:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 10:53:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-07-21 10:53:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:53:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 10:53:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 10:53:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:53:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 10:53:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-21 10:53:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-21 10:53:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 10:53:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 10:53:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-21 10:53:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:41,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036111803] [2022-07-21 10:53:41,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036111803] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:53:41,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458799686] [2022-07-21 10:53:41,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:41,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:53:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:53:41,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 10:53:41,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 10:53:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:42,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 3534 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 10:53:42,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:53:42,972 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-21 10:53:42,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 10:53:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-21 10:53:43,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458799686] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 10:53:43,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 10:53:43,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 14 [2022-07-21 10:53:43,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186477868] [2022-07-21 10:53:43,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 10:53:43,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 10:53:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:43,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 10:53:43,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-21 10:53:43,133 INFO L87 Difference]: Start difference. First operand 6580 states and 10056 transitions. Second operand has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 9 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-21 10:53:48,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:53:51,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:53:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:53:58,612 INFO L93 Difference]: Finished difference Result 13916 states and 21644 transitions. [2022-07-21 10:53:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 10:53:58,612 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 9 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 251 [2022-07-21 10:53:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:53:58,640 INFO L225 Difference]: With dead ends: 13916 [2022-07-21 10:53:58,640 INFO L226 Difference]: Without dead ends: 7389 [2022-07-21 10:53:58,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 565 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-07-21 10:53:58,666 INFO L413 NwaCegarLoop]: 2996 mSDtfsCounter, 4776 mSDsluCounter, 8791 mSDsCounter, 0 mSdLazyCounter, 9204 mSolverCounterSat, 2724 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4778 SdHoareTripleChecker+Valid, 11787 SdHoareTripleChecker+Invalid, 11930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2724 IncrementalHoareTripleChecker+Valid, 9204 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-07-21 10:53:58,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4778 Valid, 11787 Invalid, 11930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2724 Valid, 9204 Invalid, 2 Unknown, 0 Unchecked, 14.9s Time] [2022-07-21 10:53:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7389 states. [2022-07-21 10:53:58,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7389 to 6604. [2022-07-21 10:53:58,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6604 states, 5403 states have (on average 1.4826947991856376) internal successors, (8011), 5425 states have internal predecessors, (8011), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 167 states have return successors, (1036), 1033 states have call predecessors, (1036), 1025 states have call successors, (1036) [2022-07-21 10:53:58,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 10080 transitions. [2022-07-21 10:53:58,984 INFO L78 Accepts]: Start accepts. Automaton has 6604 states and 10080 transitions. Word has length 251 [2022-07-21 10:53:58,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:53:58,984 INFO L495 AbstractCegarLoop]: Abstraction has 6604 states and 10080 transitions. [2022-07-21 10:53:58,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 17.214285714285715) internal successors, (241), 7 states have internal predecessors, (241), 2 states have call successors, (61), 9 states have call predecessors, (61), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-21 10:53:58,985 INFO L276 IsEmpty]: Start isEmpty. Operand 6604 states and 10080 transitions. [2022-07-21 10:53:59,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-07-21 10:53:59,003 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:53:59,004 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:53:59,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-21 10:53:59,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-21 10:53:59,220 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:53:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:53:59,220 INFO L85 PathProgramCache]: Analyzing trace with hash 158230500, now seen corresponding path program 2 times [2022-07-21 10:53:59,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:53:59,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800007923] [2022-07-21 10:53:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:53:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:53:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:53:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:53:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:53:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:53:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:53:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:53:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:53:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:53:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:53:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:53:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 10:53:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:53:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:53:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:53:59,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 10:53:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 10:53:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:53:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 10:53:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 10:53:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:53:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:53:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 10:53:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 10:53:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:53:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-21 10:53:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 10:53:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 10:53:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-21 10:53:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2022-07-21 10:53:59,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:53:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:53:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-21 10:53:59,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:53:59,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800007923] [2022-07-21 10:53:59,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800007923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:53:59,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:53:59,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 10:53:59,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806097262] [2022-07-21 10:53:59,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:53:59,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 10:53:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:53:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 10:53:59,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 10:53:59,952 INFO L87 Difference]: Start difference. First operand 6604 states and 10080 transitions. Second operand has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-21 10:54:06,678 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:54:08,719 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-21 10:54:23,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:54:25,353 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-21 10:54:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:54:28,979 INFO L93 Difference]: Finished difference Result 17791 states and 28156 transitions. [2022-07-21 10:54:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 10:54:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 257 [2022-07-21 10:54:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:54:29,030 INFO L225 Difference]: With dead ends: 17791 [2022-07-21 10:54:29,030 INFO L226 Difference]: Without dead ends: 11240 [2022-07-21 10:54:29,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2022-07-21 10:54:29,058 INFO L413 NwaCegarLoop]: 4551 mSDtfsCounter, 6042 mSDsluCounter, 21183 mSDsCounter, 0 mSdLazyCounter, 15175 mSolverCounterSat, 2687 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6296 SdHoareTripleChecker+Valid, 25734 SdHoareTripleChecker+Invalid, 17866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2687 IncrementalHoareTripleChecker+Valid, 15175 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.0s IncrementalHoareTripleChecker+Time [2022-07-21 10:54:29,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6296 Valid, 25734 Invalid, 17866 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2687 Valid, 15175 Invalid, 4 Unknown, 0 Unchecked, 28.0s Time] [2022-07-21 10:54:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11240 states. [2022-07-21 10:54:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11240 to 6618. [2022-07-21 10:54:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6618 states, 5415 states have (on average 1.4816251154201292) internal successors, (8023), 5435 states have internal predecessors, (8023), 1033 states have call successors, (1033), 167 states have call predecessors, (1033), 169 states have return successors, (1041), 1037 states have call predecessors, (1041), 1025 states have call successors, (1041) [2022-07-21 10:54:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6618 states to 6618 states and 10097 transitions. [2022-07-21 10:54:29,499 INFO L78 Accepts]: Start accepts. Automaton has 6618 states and 10097 transitions. Word has length 257 [2022-07-21 10:54:29,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:54:29,500 INFO L495 AbstractCegarLoop]: Abstraction has 6618 states and 10097 transitions. [2022-07-21 10:54:29,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.461538461538462) internal successors, (162), 5 states have internal predecessors, (162), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-21 10:54:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 6618 states and 10097 transitions. [2022-07-21 10:54:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-07-21 10:54:29,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:54:29,518 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:54:29,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 10:54:29,518 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:54:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:54:29,519 INFO L85 PathProgramCache]: Analyzing trace with hash 735751408, now seen corresponding path program 1 times [2022-07-21 10:54:29,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:54:29,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751522240] [2022-07-21 10:54:29,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:54:29,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:54:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:54:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:54:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:54:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:54:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:54:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:54:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:54:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:54:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:54:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:54:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 10:54:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:54:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:54:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:54:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 10:54:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 10:54:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:54:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:29,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 10:54:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 10:54:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:54:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:54:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 10:54:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 10:54:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:54:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-21 10:54:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 10:54:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 10:54:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 10:54:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-07-21 10:54:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 10:54:30,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:54:30,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751522240] [2022-07-21 10:54:30,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751522240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:54:30,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:54:30,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 10:54:30,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955933359] [2022-07-21 10:54:30,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:54:30,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 10:54:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:54:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 10:54:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 10:54:30,230 INFO L87 Difference]: Start difference. First operand 6618 states and 10097 transitions. Second operand has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-21 10:54:36,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:54:47,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:54:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:54:50,415 INFO L93 Difference]: Finished difference Result 11995 states and 19154 transitions. [2022-07-21 10:54:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 10:54:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) Word has length 260 [2022-07-21 10:54:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:54:50,465 INFO L225 Difference]: With dead ends: 11995 [2022-07-21 10:54:50,465 INFO L226 Difference]: Without dead ends: 11069 [2022-07-21 10:54:50,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-07-21 10:54:50,479 INFO L413 NwaCegarLoop]: 4460 mSDtfsCounter, 6938 mSDsluCounter, 17923 mSDsCounter, 0 mSdLazyCounter, 12760 mSolverCounterSat, 3125 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6940 SdHoareTripleChecker+Valid, 22383 SdHoareTripleChecker+Invalid, 15886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3125 IncrementalHoareTripleChecker+Valid, 12760 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2022-07-21 10:54:50,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6940 Valid, 22383 Invalid, 15886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3125 Valid, 12760 Invalid, 1 Unknown, 0 Unchecked, 19.2s Time] [2022-07-21 10:54:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11069 states. [2022-07-21 10:54:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11069 to 6470. [2022-07-21 10:54:50,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6470 states, 5288 states have (on average 1.4784417549167927) internal successors, (7818), 5307 states have internal predecessors, (7818), 1013 states have call successors, (1013), 166 states have call predecessors, (1013), 168 states have return successors, (1022), 1018 states have call predecessors, (1022), 1006 states have call successors, (1022) [2022-07-21 10:54:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6470 states to 6470 states and 9853 transitions. [2022-07-21 10:54:50,972 INFO L78 Accepts]: Start accepts. Automaton has 6470 states and 9853 transitions. Word has length 260 [2022-07-21 10:54:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:54:50,973 INFO L495 AbstractCegarLoop]: Abstraction has 6470 states and 9853 transitions. [2022-07-21 10:54:50,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.307692307692308) internal successors, (160), 5 states have internal predecessors, (160), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 2 states have call successors, (33) [2022-07-21 10:54:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 6470 states and 9853 transitions. [2022-07-21 10:54:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2022-07-21 10:54:50,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:54:50,986 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:54:50,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 10:54:50,986 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:54:50,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:54:50,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1715192008, now seen corresponding path program 1 times [2022-07-21 10:54:50,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:54:50,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578352588] [2022-07-21 10:54:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:54:50,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:54:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:54:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:54:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:54:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:54:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:54:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:54:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:54:51,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:54:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:54:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:54:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 10:54:51,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:54:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:54:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:54:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 10:54:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 10:54:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:54:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 10:54:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 10:54:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:54:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:54:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 10:54:51,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 10:54:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:54:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:54:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-21 10:54:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-21 10:54:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 10:54:51,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 10:54:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 10:54:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-21 10:54:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-21 10:54:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:54:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-21 10:54:51,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:54:51,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578352588] [2022-07-21 10:54:51,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578352588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 10:54:51,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 10:54:51,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 10:54:51,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717040234] [2022-07-21 10:54:51,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 10:54:51,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 10:54:51,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:54:51,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 10:54:51,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-21 10:54:51,521 INFO L87 Difference]: Start difference. First operand 6470 states and 9853 transitions. Second operand has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-21 10:54:58,621 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:55:00,649 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:55:14,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 10:55:16,218 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-21 10:55:20,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 10:55:20,108 INFO L93 Difference]: Finished difference Result 12992 states and 20609 transitions. [2022-07-21 10:55:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 10:55:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 266 [2022-07-21 10:55:20,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 10:55:20,148 INFO L225 Difference]: With dead ends: 12992 [2022-07-21 10:55:20,148 INFO L226 Difference]: Without dead ends: 11063 [2022-07-21 10:55:20,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-07-21 10:55:20,163 INFO L413 NwaCegarLoop]: 4463 mSDtfsCounter, 6913 mSDsluCounter, 19065 mSDsCounter, 0 mSdLazyCounter, 14960 mSolverCounterSat, 2756 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6915 SdHoareTripleChecker+Valid, 23528 SdHoareTripleChecker+Invalid, 17720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2756 IncrementalHoareTripleChecker+Valid, 14960 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2022-07-21 10:55:20,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6915 Valid, 23528 Invalid, 17720 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2756 Valid, 14960 Invalid, 4 Unknown, 0 Unchecked, 27.6s Time] [2022-07-21 10:55:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11063 states. [2022-07-21 10:55:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11063 to 6464. [2022-07-21 10:55:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6464 states, 5284 states have (on average 1.4780469341408025) internal successors, (7810), 5303 states have internal predecessors, (7810), 1011 states have call successors, (1011), 166 states have call predecessors, (1011), 168 states have return successors, (1020), 1016 states have call predecessors, (1020), 1004 states have call successors, (1020) [2022-07-21 10:55:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6464 states to 6464 states and 9841 transitions. [2022-07-21 10:55:20,577 INFO L78 Accepts]: Start accepts. Automaton has 6464 states and 9841 transitions. Word has length 266 [2022-07-21 10:55:20,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 10:55:20,577 INFO L495 AbstractCegarLoop]: Abstraction has 6464 states and 9841 transitions. [2022-07-21 10:55:20,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.384615384615385) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-21 10:55:20,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6464 states and 9841 transitions. [2022-07-21 10:55:20,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-21 10:55:20,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 10:55:20,591 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 10:55:20,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 10:55:20,591 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 10:55:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 10:55:20,592 INFO L85 PathProgramCache]: Analyzing trace with hash 885064232, now seen corresponding path program 1 times [2022-07-21 10:55:20,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 10:55:20,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290196212] [2022-07-21 10:55:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:20,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 10:55:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 10:55:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 10:55:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-21 10:55:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-21 10:55:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 10:55:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-21 10:55:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 10:55:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 10:55:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 10:55:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 10:55:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 10:55:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 10:55:20,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-21 10:55:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-21 10:55:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 10:55:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-21 10:55:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 10:55:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 10:55:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 10:55:20,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:20,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-21 10:55:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 10:55:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 10:55:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-21 10:55:21,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-21 10:55:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-21 10:55:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 10:55:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 10:55:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 10:55:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 10:55:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 10:55:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 10:55:21,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2022-07-21 10:55:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 10:55:21,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 10:55:21,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290196212] [2022-07-21 10:55:21,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290196212] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 10:55:21,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811739733] [2022-07-21 10:55:21,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 10:55:21,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 10:55:21,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 10:55:21,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 10:55:21,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-21 10:55:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 10:55:22,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 3744 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 10:55:22,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 10:55:22,367 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-07-21 10:55:22,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 10:55:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-07-21 10:55:22,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811739733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 10:55:22,612 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 10:55:22,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4, 4] total 13 [2022-07-21 10:55:22,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220460332] [2022-07-21 10:55:22,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 10:55:22,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 10:55:22,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 10:55:22,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 10:55:22,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-21 10:55:22,614 INFO L87 Difference]: Start difference. First operand 6464 states and 9841 transitions. Second operand has 13 states, 13 states have (on average 19.46153846153846) internal successors, (253), 5 states have internal predecessors, (253), 4 states have call successors, (73), 10 states have call predecessors, (73), 2 states have return successors, (63), 4 states have call predecessors, (63), 4 states have call successors, (63)