./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6b3de547936c1646f60b80d97a1625774e2d4a48db257d02bb1b2f3a0d43e91e --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 23:39:11,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 23:39:11,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 23:39:11,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 23:39:11,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 23:39:11,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 23:39:11,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 23:39:11,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 23:39:11,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 23:39:11,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 23:39:11,110 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 23:39:11,112 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 23:39:11,112 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 23:39:11,114 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 23:39:11,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 23:39:11,118 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 23:39:11,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 23:39:11,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 23:39:11,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 23:39:11,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 23:39:11,128 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 23:39:11,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 23:39:11,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 23:39:11,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 23:39:11,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 23:39:11,138 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 23:39:11,138 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 23:39:11,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 23:39:11,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 23:39:11,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 23:39:11,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 23:39:11,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 23:39:11,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 23:39:11,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 23:39:11,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 23:39:11,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 23:39:11,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 23:39:11,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 23:39:11,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 23:39:11,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 23:39:11,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 23:39:11,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 23:39:11,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 23:39:11,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 23:39:11,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 23:39:11,178 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 23:39:11,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 23:39:11,180 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 23:39:11,180 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 23:39:11,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 23:39:11,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 23:39:11,181 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 23:39:11,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 23:39:11,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 23:39:11,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 23:39:11,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 23:39:11,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 23:39:11,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 23:39:11,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 23:39:11,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 23:39:11,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 23:39:11,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 23:39:11,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 23:39:11,184 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 23:39:11,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:39:11,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 23:39:11,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 23:39:11,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 23:39:11,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 23:39:11,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 23:39:11,187 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 23:39:11,187 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 23:39:11,187 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 23:39:11,188 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 -> 6b3de547936c1646f60b80d97a1625774e2d4a48db257d02bb1b2f3a0d43e91e [2022-07-19 23:39:11,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 23:39:11,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 23:39:11,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 23:39:11,421 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 23:39:11,423 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 23:39:11,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-07-19 23:39:11,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f24874f/22516ba80f9141f9a5db90327fc0efd3/FLAGccf5b5933 [2022-07-19 23:39:12,149 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 23:39:12,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-07-19 23:39:12,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f24874f/22516ba80f9141f9a5db90327fc0efd3/FLAGccf5b5933 [2022-07-19 23:39:12,307 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61f24874f/22516ba80f9141f9a5db90327fc0efd3 [2022-07-19 23:39:12,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 23:39:12,310 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 23:39:12,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 23:39:12,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 23:39:12,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 23:39:12,315 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:39:12" (1/1) ... [2022-07-19 23:39:12,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c2575e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:12, skipping insertion in model container [2022-07-19 23:39:12,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 11:39:12" (1/1) ... [2022-07-19 23:39:12,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 23:39:12,427 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 23:39:13,069 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-07-19 23:39:13,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:39:13,612 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 23:39:13,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i[154748,154761] [2022-07-19 23:39:13,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 23:39:13,996 INFO L208 MainTranslator]: Completed translation [2022-07-19 23:39:13,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13 WrapperNode [2022-07-19 23:39:13,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 23:39:13,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 23:39:13,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 23:39:13,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 23:39:14,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,082 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,199 INFO L137 Inliner]: procedures = 174, calls = 1111, calls flagged for inlining = 78, calls inlined = 75, statements flattened = 3508 [2022-07-19 23:39:14,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 23:39:14,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 23:39:14,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 23:39:14,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 23:39:14,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 23:39:14,458 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 23:39:14,458 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 23:39:14,458 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 23:39:14,459 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (1/1) ... [2022-07-19 23:39:14,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 23:39:14,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:39:14,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 23:39:14,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 23:39:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure dlci_to_q922 [2022-07-19 23:39:14,534 INFO L138 BoogieDeclarations]: Found implementation of procedure dlci_to_q922 [2022-07-19 23:39:14,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 23:39:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 23:39:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 23:39:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-19 23:39:14,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-19 23:39:14,535 INFO L130 BoogieDeclarations]: Found specification of procedure dev_queue_xmit [2022-07-19 23:39:14,535 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_queue_xmit [2022-07-19 23:39:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 23:39:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure state [2022-07-19 23:39:14,536 INFO L138 BoogieDeclarations]: Found implementation of procedure state [2022-07-19 23:39:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure fr_hard_header [2022-07-19 23:39:14,536 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_hard_header [2022-07-19 23:39:14,536 INFO L130 BoogieDeclarations]: Found specification of procedure find_pvc [2022-07-19 23:39:14,536 INFO L138 BoogieDeclarations]: Found implementation of procedure find_pvc [2022-07-19 23:39:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure dev_to_hdlc [2022-07-19 23:39:14,537 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_to_hdlc [2022-07-19 23:39:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-19 23:39:14,537 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-19 23:39:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 23:39:14,537 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 23:39:14,537 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2022-07-19 23:39:14,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2022-07-19 23:39:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_off [2022-07-19 23:39:14,538 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_off [2022-07-19 23:39:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_carrier [2022-07-19 23:39:14,538 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_carrier [2022-07-19 23:39:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 23:39:14,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 23:39:14,538 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_disconnect_2 [2022-07-19 23:39:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_disconnect_2 [2022-07-19 23:39:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2022-07-19 23:39:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2022-07-19 23:39:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2022-07-19 23:39:14,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2022-07-19 23:39:14,539 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 23:39:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 23:39:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure fr_rx [2022-07-19 23:39:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_rx [2022-07-19 23:39:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_ioctl [2022-07-19 23:39:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_ioctl [2022-07-19 23:39:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 23:39:14,540 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-19 23:39:14,540 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-19 23:39:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-19 23:39:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-19 23:39:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure fr_ioctl [2022-07-19 23:39:14,541 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_ioctl [2022-07-19 23:39:14,541 INFO L130 BoogieDeclarations]: Found specification of procedure skb_pull [2022-07-19 23:39:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_pull [2022-07-19 23:39:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_ok [2022-07-19 23:39:14,542 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_ok [2022-07-19 23:39:14,542 INFO L130 BoogieDeclarations]: Found specification of procedure netif_carrier_on [2022-07-19 23:39:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_carrier_on [2022-07-19 23:39:14,543 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-19 23:39:14,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-19 23:39:14,544 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_netdev_mqs [2022-07-19 23:39:14,544 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_netdev_mqs [2022-07-19 23:39:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 23:39:14,545 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 23:39:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 23:39:14,545 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 23:39:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 23:39:14,545 INFO L130 BoogieDeclarations]: Found specification of procedure hdlc_change_mtu [2022-07-19 23:39:14,546 INFO L138 BoogieDeclarations]: Found implementation of procedure hdlc_change_mtu [2022-07-19 23:39:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-19 23:39:14,546 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-19 23:39:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2022-07-19 23:39:14,546 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2022-07-19 23:39:14,546 INFO L130 BoogieDeclarations]: Found specification of procedure fr_log_dlci_active [2022-07-19 23:39:14,546 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_log_dlci_active [2022-07-19 23:39:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 23:39:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 23:39:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 23:39:14,547 INFO L130 BoogieDeclarations]: Found specification of procedure delete_unused_pvcs [2022-07-19 23:39:14,547 INFO L138 BoogieDeclarations]: Found implementation of procedure delete_unused_pvcs [2022-07-19 23:39:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure reg_timer_1 [2022-07-19 23:39:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure reg_timer_1 [2022-07-19 23:39:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-19 23:39:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-19 23:39:14,548 INFO L130 BoogieDeclarations]: Found specification of procedure pvc_is_used [2022-07-19 23:39:14,548 INFO L138 BoogieDeclarations]: Found implementation of procedure pvc_is_used [2022-07-19 23:39:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 23:39:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2022-07-19 23:39:14,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2022-07-19 23:39:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-07-19 23:39:14,549 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-07-19 23:39:14,549 INFO L130 BoogieDeclarations]: Found specification of procedure fr_set_link_state [2022-07-19 23:39:14,550 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_set_link_state [2022-07-19 23:39:14,550 INFO L130 BoogieDeclarations]: Found specification of procedure fr_lmi_send [2022-07-19 23:39:14,550 INFO L138 BoogieDeclarations]: Found implementation of procedure fr_lmi_send [2022-07-19 23:39:14,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 23:39:14,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 23:39:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-19 23:39:14,551 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-19 23:39:14,551 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-19 23:39:14,551 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-19 23:39:14,552 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-07-19 23:39:14,552 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-07-19 23:39:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-19 23:39:14,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-19 23:39:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure get_dev_p [2022-07-19 23:39:14,553 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dev_p [2022-07-19 23:39:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 23:39:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure linkwatch_fire_event [2022-07-19 23:39:14,554 INFO L138 BoogieDeclarations]: Found implementation of procedure linkwatch_fire_event [2022-07-19 23:39:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure add_pvc [2022-07-19 23:39:14,554 INFO L138 BoogieDeclarations]: Found implementation of procedure add_pvc [2022-07-19 23:39:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdevice [2022-07-19 23:39:14,554 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdevice [2022-07-19 23:39:14,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 23:39:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-19 23:39:14,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-19 23:39:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-19 23:39:14,555 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-19 23:39:14,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 23:39:14,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 23:39:15,104 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 23:39:15,108 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 23:39:15,272 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-19 23:39:17,133 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 23:39:17,157 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 23:39:17,158 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-19 23:39:17,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:39:17 BoogieIcfgContainer [2022-07-19 23:39:17,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 23:39:17,164 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 23:39:17,164 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 23:39:17,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 23:39:17,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 11:39:12" (1/3) ... [2022-07-19 23:39:17,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2bbc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:39:17, skipping insertion in model container [2022-07-19 23:39:17,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 11:39:13" (2/3) ... [2022-07-19 23:39:17,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d2bbc02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 11:39:17, skipping insertion in model container [2022-07-19 23:39:17,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 11:39:17" (3/3) ... [2022-07-19 23:39:17,177 INFO L111 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wan--hdlc_fr.ko-entry_point.cil.out.i [2022-07-19 23:39:17,189 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 23:39:17,189 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 23:39:17,276 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 23:39:17,282 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@7148a00f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5478504d [2022-07-19 23:39:17,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 23:39:17,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 1162 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 861 states have internal predecessors, (1164), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) [2022-07-19 23:39:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 23:39:17,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:17,299 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:39:17,299 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:17,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:17,303 INFO L85 PathProgramCache]: Analyzing trace with hash 16503480, now seen corresponding path program 1 times [2022-07-19 23:39:17,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:17,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678015736] [2022-07-19 23:39:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:17,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:17,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:17,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:39:17,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:17,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:17,729 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 23:39:17,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:17,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678015736] [2022-07-19 23:39:17,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678015736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:17,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:17,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 23:39:17,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395658260] [2022-07-19 23:39:17,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:17,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 23:39:17,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:17,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 23:39:17,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 23:39:17,766 INFO L87 Difference]: Start difference. First operand has 1162 states, 845 states have (on average 1.3775147928994083) internal successors, (1164), 861 states have internal predecessors, (1164), 265 states have call successors, (265), 51 states have call predecessors, (265), 50 states have return successors, (261), 260 states have call predecessors, (261), 261 states have call successors, (261) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 23:39:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:21,343 INFO L93 Difference]: Finished difference Result 3724 states and 5603 transitions. [2022-07-19 23:39:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:39:21,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-07-19 23:39:21,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:21,378 INFO L225 Difference]: With dead ends: 3724 [2022-07-19 23:39:21,379 INFO L226 Difference]: Without dead ends: 2551 [2022-07-19 23:39:21,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:39:21,396 INFO L413 NwaCegarLoop]: 1891 mSDtfsCounter, 2215 mSDsluCounter, 1910 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2437 SdHoareTripleChecker+Valid, 3801 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 754 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:21,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2437 Valid, 3801 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [754 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-19 23:39:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2022-07-19 23:39:21,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 2273. [2022-07-19 23:39:21,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2273 states, 1659 states have (on average 1.3664858348402653) internal successors, (2267), 1679 states have internal predecessors, (2267), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-19 23:39:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2273 states to 2273 states and 3296 transitions. [2022-07-19 23:39:21,660 INFO L78 Accepts]: Start accepts. Automaton has 2273 states and 3296 transitions. Word has length 41 [2022-07-19 23:39:21,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:21,661 INFO L495 AbstractCegarLoop]: Abstraction has 2273 states and 3296 transitions. [2022-07-19 23:39:21,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 23:39:21,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2273 states and 3296 transitions. [2022-07-19 23:39:21,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 23:39:21,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:21,665 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:39:21,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 23:39:21,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:21,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:21,666 INFO L85 PathProgramCache]: Analyzing trace with hash 202884705, now seen corresponding path program 1 times [2022-07-19 23:39:21,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:21,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351863922] [2022-07-19 23:39:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:21,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:21,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:39:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:21,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 23:39:21,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:21,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351863922] [2022-07-19 23:39:21,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351863922] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:21,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:21,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:39:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509844549] [2022-07-19 23:39:21,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:21,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:39:21,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:21,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:39:21,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:39:21,809 INFO L87 Difference]: Start difference. First operand 2273 states and 3296 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 23:39:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:24,513 INFO L93 Difference]: Finished difference Result 4811 states and 7034 transitions. [2022-07-19 23:39:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:39:24,514 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-19 23:39:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:24,530 INFO L225 Difference]: With dead ends: 4811 [2022-07-19 23:39:24,530 INFO L226 Difference]: Without dead ends: 2550 [2022-07-19 23:39:24,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:39:24,546 INFO L413 NwaCegarLoop]: 2045 mSDtfsCounter, 2219 mSDsluCounter, 2182 mSDsCounter, 0 mSdLazyCounter, 1490 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 4227 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 1490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:24,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 4227 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 1490 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 23:39:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2022-07-19 23:39:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2272. [2022-07-19 23:39:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2272 states, 1658 states have (on average 1.3648974668275031) internal successors, (2263), 1678 states have internal predecessors, (2263), 515 states have call successors, (515), 99 states have call predecessors, (515), 98 states have return successors, (514), 512 states have call predecessors, (514), 514 states have call successors, (514) [2022-07-19 23:39:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 3292 transitions. [2022-07-19 23:39:24,649 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 3292 transitions. Word has length 44 [2022-07-19 23:39:24,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:24,650 INFO L495 AbstractCegarLoop]: Abstraction has 2272 states and 3292 transitions. [2022-07-19 23:39:24,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 23:39:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 3292 transitions. [2022-07-19 23:39:24,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-19 23:39:24,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:24,660 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-19 23:39:24,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 23:39:24,662 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:24,663 INFO L85 PathProgramCache]: Analyzing trace with hash -94841370, now seen corresponding path program 1 times [2022-07-19 23:39:24,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:24,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809118583] [2022-07-19 23:39:24,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:24,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:39:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:39:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 23:39:24,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:24,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809118583] [2022-07-19 23:39:24,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809118583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:24,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:24,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:39:24,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524572587] [2022-07-19 23:39:24,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:24,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:39:24,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:24,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:39:24,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:39:24,870 INFO L87 Difference]: Start difference. First operand 2272 states and 3292 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 23:39:29,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:29,258 INFO L93 Difference]: Finished difference Result 7337 states and 10822 transitions. [2022-07-19 23:39:29,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:39:29,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 66 [2022-07-19 23:39:29,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:29,291 INFO L225 Difference]: With dead ends: 7337 [2022-07-19 23:39:29,291 INFO L226 Difference]: Without dead ends: 5072 [2022-07-19 23:39:29,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:39:29,305 INFO L413 NwaCegarLoop]: 1880 mSDtfsCounter, 2202 mSDsluCounter, 4521 mSDsCounter, 0 mSdLazyCounter, 3075 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2422 SdHoareTripleChecker+Valid, 6401 SdHoareTripleChecker+Invalid, 3824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 3075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:29,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2422 Valid, 6401 Invalid, 3824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 3075 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-19 23:39:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5072 states. [2022-07-19 23:39:29,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5072 to 4554. [2022-07-19 23:39:29,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4554 states, 3324 states have (on average 1.3655234657039712) internal successors, (4539), 3368 states have internal predecessors, (4539), 1025 states have call successors, (1025), 197 states have call predecessors, (1025), 204 states have return successors, (1084), 1024 states have call predecessors, (1084), 1024 states have call successors, (1084) [2022-07-19 23:39:29,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4554 states to 4554 states and 6648 transitions. [2022-07-19 23:39:29,539 INFO L78 Accepts]: Start accepts. Automaton has 4554 states and 6648 transitions. Word has length 66 [2022-07-19 23:39:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:29,543 INFO L495 AbstractCegarLoop]: Abstraction has 4554 states and 6648 transitions. [2022-07-19 23:39:29,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 23:39:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 4554 states and 6648 transitions. [2022-07-19 23:39:29,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-19 23:39:29,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:29,556 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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-19 23:39:29,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 23:39:29,558 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:29,559 INFO L85 PathProgramCache]: Analyzing trace with hash -248182647, now seen corresponding path program 1 times [2022-07-19 23:39:29,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:29,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805365560] [2022-07-19 23:39:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:29,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:39:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:39:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:39:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-07-19 23:39:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:29,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805365560] [2022-07-19 23:39:29,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805365560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:29,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:29,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:39:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020058824] [2022-07-19 23:39:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:29,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:39:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:39:29,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:39:29,767 INFO L87 Difference]: Start difference. First operand 4554 states and 6648 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 23:39:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:35,537 INFO L93 Difference]: Finished difference Result 15534 states and 23138 transitions. [2022-07-19 23:39:35,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:39:35,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 103 [2022-07-19 23:39:35,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:35,598 INFO L225 Difference]: With dead ends: 15534 [2022-07-19 23:39:35,598 INFO L226 Difference]: Without dead ends: 10992 [2022-07-19 23:39:35,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:39:35,622 INFO L413 NwaCegarLoop]: 2704 mSDtfsCounter, 2578 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 3727 mSolverCounterSat, 1255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2787 SdHoareTripleChecker+Valid, 5359 SdHoareTripleChecker+Invalid, 4982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1255 IncrementalHoareTripleChecker+Valid, 3727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:35,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2787 Valid, 5359 Invalid, 4982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1255 Valid, 3727 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-07-19 23:39:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10992 states. [2022-07-19 23:39:35,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10992 to 9020. [2022-07-19 23:39:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9020 states, 6596 states have (on average 1.3635536688902365) internal successors, (8994), 6698 states have internal predecessors, (8994), 2007 states have call successors, (2007), 389 states have call predecessors, (2007), 416 states have return successors, (2153), 2004 states have call predecessors, (2153), 2006 states have call successors, (2153) [2022-07-19 23:39:36,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9020 states to 9020 states and 13154 transitions. [2022-07-19 23:39:36,065 INFO L78 Accepts]: Start accepts. Automaton has 9020 states and 13154 transitions. Word has length 103 [2022-07-19 23:39:36,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:36,065 INFO L495 AbstractCegarLoop]: Abstraction has 9020 states and 13154 transitions. [2022-07-19 23:39:36,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 3 states have internal predecessors, (71), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 23:39:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 9020 states and 13154 transitions. [2022-07-19 23:39:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-19 23:39:36,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:36,081 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2022-07-19 23:39:36,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 23:39:36,082 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1651725426, now seen corresponding path program 1 times [2022-07-19 23:39:36,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:36,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287033253] [2022-07-19 23:39:36,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:39:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-19 23:39:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 23:39:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:39:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-19 23:39:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:36,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287033253] [2022-07-19 23:39:36,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287033253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:36,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:36,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:39:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560860900] [2022-07-19 23:39:36,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:36,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:39:36,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:36,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:39:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:39:36,293 INFO L87 Difference]: Start difference. First operand 9020 states and 13154 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:39:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:41,383 INFO L93 Difference]: Finished difference Result 19708 states and 29148 transitions. [2022-07-19 23:39:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:39:41,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2022-07-19 23:39:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:41,451 INFO L225 Difference]: With dead ends: 19708 [2022-07-19 23:39:41,451 INFO L226 Difference]: Without dead ends: 10700 [2022-07-19 23:39:41,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:39:41,495 INFO L413 NwaCegarLoop]: 1851 mSDtfsCounter, 3137 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 3064 mSolverCounterSat, 1629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3343 SdHoareTripleChecker+Valid, 3857 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1629 IncrementalHoareTripleChecker+Valid, 3064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:41,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3343 Valid, 3857 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1629 Valid, 3064 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-19 23:39:41,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10700 states. [2022-07-19 23:39:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10700 to 8736. [2022-07-19 23:39:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8736 states, 6368 states have (on average 1.3613379396984924) internal successors, (8669), 6472 states have internal predecessors, (8669), 1957 states have call successors, (1957), 383 states have call predecessors, (1957), 410 states have return successors, (2098), 1952 states have call predecessors, (2098), 1956 states have call successors, (2098) [2022-07-19 23:39:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8736 states to 8736 states and 12724 transitions. [2022-07-19 23:39:41,965 INFO L78 Accepts]: Start accepts. Automaton has 8736 states and 12724 transitions. Word has length 95 [2022-07-19 23:39:41,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:41,966 INFO L495 AbstractCegarLoop]: Abstraction has 8736 states and 12724 transitions. [2022-07-19 23:39:41,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:39:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 8736 states and 12724 transitions. [2022-07-19 23:39:41,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-19 23:39:41,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:41,983 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 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] [2022-07-19 23:39:41,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 23:39:41,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:41,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:41,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1725212051, now seen corresponding path program 1 times [2022-07-19 23:39:41,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:41,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42561232] [2022-07-19 23:39:41,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:41,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:42,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:39:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:39:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 23:39:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-19 23:39:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:42,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42561232] [2022-07-19 23:39:42,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42561232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:42,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:42,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:39:42,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152011152] [2022-07-19 23:39:42,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:42,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:39:42,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:42,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:39:42,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:39:42,125 INFO L87 Difference]: Start difference. First operand 8736 states and 12724 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:39:47,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:47,457 INFO L93 Difference]: Finished difference Result 19998 states and 29670 transitions. [2022-07-19 23:39:47,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:39:47,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 117 [2022-07-19 23:39:47,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:47,522 INFO L225 Difference]: With dead ends: 19998 [2022-07-19 23:39:47,522 INFO L226 Difference]: Without dead ends: 13371 [2022-07-19 23:39:47,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:39:47,553 INFO L413 NwaCegarLoop]: 2871 mSDtfsCounter, 2477 mSDsluCounter, 2839 mSDsCounter, 0 mSdLazyCounter, 3866 mSolverCounterSat, 1206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2691 SdHoareTripleChecker+Valid, 5710 SdHoareTripleChecker+Invalid, 5072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1206 IncrementalHoareTripleChecker+Valid, 3866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:47,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2691 Valid, 5710 Invalid, 5072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1206 Valid, 3866 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-19 23:39:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13371 states. [2022-07-19 23:39:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13371 to 10917. [2022-07-19 23:39:48,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10917 states, 7963 states have (on average 1.361170413160869) internal successors, (10839), 8094 states have internal predecessors, (10839), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-07-19 23:39:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10917 states to 10917 states and 15890 transitions. [2022-07-19 23:39:48,176 INFO L78 Accepts]: Start accepts. Automaton has 10917 states and 15890 transitions. Word has length 117 [2022-07-19 23:39:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:48,176 INFO L495 AbstractCegarLoop]: Abstraction has 10917 states and 15890 transitions. [2022-07-19 23:39:48,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:39:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 10917 states and 15890 transitions. [2022-07-19 23:39:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-19 23:39:48,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:48,193 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 23:39:48,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 23:39:48,194 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:48,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:48,194 INFO L85 PathProgramCache]: Analyzing trace with hash -159171181, now seen corresponding path program 1 times [2022-07-19 23:39:48,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:48,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646418412] [2022-07-19 23:39:48,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:48,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:39:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:48,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:39:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 23:39:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-19 23:39:48,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:48,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646418412] [2022-07-19 23:39:48,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646418412] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:48,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:48,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:39:48,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442336597] [2022-07-19 23:39:48,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:48,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:39:48,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:48,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:39:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:39:48,358 INFO L87 Difference]: Start difference. First operand 10917 states and 15890 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:39:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:39:55,517 INFO L93 Difference]: Finished difference Result 27579 states and 40872 transitions. [2022-07-19 23:39:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 23:39:55,523 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 122 [2022-07-19 23:39:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:39:55,612 INFO L225 Difference]: With dead ends: 27579 [2022-07-19 23:39:55,612 INFO L226 Difference]: Without dead ends: 18771 [2022-07-19 23:39:55,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-19 23:39:55,652 INFO L413 NwaCegarLoop]: 2911 mSDtfsCounter, 2587 mSDsluCounter, 4677 mSDsCounter, 0 mSdLazyCounter, 5509 mSolverCounterSat, 1416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2728 SdHoareTripleChecker+Valid, 7588 SdHoareTripleChecker+Invalid, 6925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1416 IncrementalHoareTripleChecker+Valid, 5509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:39:55,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2728 Valid, 7588 Invalid, 6925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1416 Valid, 5509 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-07-19 23:39:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18771 states. [2022-07-19 23:39:56,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18771 to 10921. [2022-07-19 23:39:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10921 states, 7967 states have (on average 1.3609890799548137) internal successors, (10843), 8098 states have internal predecessors, (10843), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-07-19 23:39:56,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10921 states to 10921 states and 15894 transitions. [2022-07-19 23:39:56,372 INFO L78 Accepts]: Start accepts. Automaton has 10921 states and 15894 transitions. Word has length 122 [2022-07-19 23:39:56,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:39:56,373 INFO L495 AbstractCegarLoop]: Abstraction has 10921 states and 15894 transitions. [2022-07-19 23:39:56,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 23:39:56,374 INFO L276 IsEmpty]: Start isEmpty. Operand 10921 states and 15894 transitions. [2022-07-19 23:39:56,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-07-19 23:39:56,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:39:56,390 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 23:39:56,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 23:39:56,390 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:39:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:39:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1619034978, now seen corresponding path program 1 times [2022-07-19 23:39:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:39:56,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033860574] [2022-07-19 23:39:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:39:56,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:39:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:39:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:39:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:39:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:39:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:39:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:39:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:39:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:39:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:39:56,538 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-19 23:39:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:39:56,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033860574] [2022-07-19 23:39:56,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033860574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:39:56,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:39:56,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:39:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439281634] [2022-07-19 23:39:56,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:39:56,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:39:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:39:56,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:39:56,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:39:56,541 INFO L87 Difference]: Start difference. First operand 10921 states and 15894 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 23:40:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:00,637 INFO L93 Difference]: Finished difference Result 19044 states and 28439 transitions. [2022-07-19 23:40:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 23:40:00,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 132 [2022-07-19 23:40:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:00,702 INFO L225 Difference]: With dead ends: 19044 [2022-07-19 23:40:00,702 INFO L226 Difference]: Without dead ends: 13373 [2022-07-19 23:40:00,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:40:00,733 INFO L413 NwaCegarLoop]: 1539 mSDtfsCounter, 1010 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 709 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 3565 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 709 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:00,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 3565 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [709 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-19 23:40:00,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13373 states. [2022-07-19 23:40:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13373 to 10931. [2022-07-19 23:40:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10931 states, 7977 states have (on average 1.3605365425598597) internal successors, (10853), 8108 states have internal predecessors, (10853), 2438 states have call successors, (2438), 481 states have call predecessors, (2438), 515 states have return successors, (2613), 2431 states have call predecessors, (2613), 2437 states have call successors, (2613) [2022-07-19 23:40:01,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10931 states to 10931 states and 15904 transitions. [2022-07-19 23:40:01,349 INFO L78 Accepts]: Start accepts. Automaton has 10931 states and 15904 transitions. Word has length 132 [2022-07-19 23:40:01,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:01,350 INFO L495 AbstractCegarLoop]: Abstraction has 10931 states and 15904 transitions. [2022-07-19 23:40:01,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 23:40:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 10931 states and 15904 transitions. [2022-07-19 23:40:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 23:40:01,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:01,371 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 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] [2022-07-19 23:40:01,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 23:40:01,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:01,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1510120385, now seen corresponding path program 1 times [2022-07-19 23:40:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272518988] [2022-07-19 23:40:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:40:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:01,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:40:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:40:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:40:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2022-07-19 23:40:01,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:01,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272518988] [2022-07-19 23:40:01,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272518988] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:01,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:01,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 23:40:01,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233392863] [2022-07-19 23:40:01,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:01,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 23:40:01,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:01,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 23:40:01,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-19 23:40:01,605 INFO L87 Difference]: Start difference. First operand 10931 states and 15904 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 23:40:12,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:12,580 INFO L93 Difference]: Finished difference Result 27272 states and 40484 transitions. [2022-07-19 23:40:12,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 23:40:12,583 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 134 [2022-07-19 23:40:12,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:12,659 INFO L225 Difference]: With dead ends: 27272 [2022-07-19 23:40:12,660 INFO L226 Difference]: Without dead ends: 16353 [2022-07-19 23:40:12,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-07-19 23:40:12,843 INFO L413 NwaCegarLoop]: 1822 mSDtfsCounter, 5464 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 9247 mSolverCounterSat, 3161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5758 SdHoareTripleChecker+Valid, 6906 SdHoareTripleChecker+Invalid, 12408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3161 IncrementalHoareTripleChecker+Valid, 9247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:12,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5758 Valid, 6906 Invalid, 12408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3161 Valid, 9247 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-07-19 23:40:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16353 states. [2022-07-19 23:40:13,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16353 to 12266. [2022-07-19 23:40:13,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12266 states, 8957 states have (on average 1.353466562465111) internal successors, (12123), 9118 states have internal predecessors, (12123), 2688 states have call successors, (2688), 576 states have call predecessors, (2688), 620 states have return successors, (2913), 2681 states have call predecessors, (2913), 2687 states have call successors, (2913) [2022-07-19 23:40:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12266 states to 12266 states and 17724 transitions. [2022-07-19 23:40:13,492 INFO L78 Accepts]: Start accepts. Automaton has 12266 states and 17724 transitions. Word has length 134 [2022-07-19 23:40:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:13,492 INFO L495 AbstractCegarLoop]: Abstraction has 12266 states and 17724 transitions. [2022-07-19 23:40:13,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-19 23:40:13,493 INFO L276 IsEmpty]: Start isEmpty. Operand 12266 states and 17724 transitions. [2022-07-19 23:40:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-19 23:40:13,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:13,523 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 7, 3, 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] [2022-07-19 23:40:13,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 23:40:13,524 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1419893241, now seen corresponding path program 1 times [2022-07-19 23:40:13,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873523712] [2022-07-19 23:40:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:13,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:40:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:40:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:40:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:40:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:40:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:40:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:40:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:40:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 23:40:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:40:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:40:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:40:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:40:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:40:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:40:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:40:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 23:40:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 23:40:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 23:40:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 23:40:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 23:40:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 23:40:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:40:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 23:40:13,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 498 trivial. 0 not checked. [2022-07-19 23:40:13,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:13,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873523712] [2022-07-19 23:40:13,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873523712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:13,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:13,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 23:40:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627207755] [2022-07-19 23:40:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:13,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 23:40:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 23:40:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:40:13,942 INFO L87 Difference]: Start difference. First operand 12266 states and 17724 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 23:40:16,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:16,738 INFO L93 Difference]: Finished difference Result 27785 states and 40884 transitions. [2022-07-19 23:40:16,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 23:40:16,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 208 [2022-07-19 23:40:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:16,801 INFO L225 Difference]: With dead ends: 27785 [2022-07-19 23:40:16,801 INFO L226 Difference]: Without dead ends: 15531 [2022-07-19 23:40:16,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 23:40:16,840 INFO L413 NwaCegarLoop]: 1641 mSDtfsCounter, 885 mSDsluCounter, 1862 mSDsCounter, 0 mSdLazyCounter, 1370 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 950 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 1370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:16,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [950 Valid, 3503 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 1370 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-19 23:40:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15531 states. [2022-07-19 23:40:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15531 to 13416. [2022-07-19 23:40:17,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13416 states, 9907 states have (on average 1.3498536388412234) internal successors, (13373), 10098 states have internal predecessors, (13373), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 620 states have return successors, (3158), 2891 states have call predecessors, (3158), 2887 states have call successors, (3158) [2022-07-19 23:40:17,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13416 states to 13416 states and 19419 transitions. [2022-07-19 23:40:17,460 INFO L78 Accepts]: Start accepts. Automaton has 13416 states and 19419 transitions. Word has length 208 [2022-07-19 23:40:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:17,460 INFO L495 AbstractCegarLoop]: Abstraction has 13416 states and 19419 transitions. [2022-07-19 23:40:17,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 23:40:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 13416 states and 19419 transitions. [2022-07-19 23:40:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-07-19 23:40:17,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:17,488 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 7, 3, 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] [2022-07-19 23:40:17,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 23:40:17,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:17,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:17,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1308316105, now seen corresponding path program 1 times [2022-07-19 23:40:17,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:17,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028049864] [2022-07-19 23:40:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:17,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:40:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:40:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:40:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:40:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:40:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:40:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:40:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:40:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 23:40:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:40:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:40:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:40:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:40:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:40:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:40:17,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:40:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 23:40:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 23:40:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 23:40:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 23:40:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 23:40:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 23:40:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 23:40:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 23:40:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-07-19 23:40:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:17,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028049864] [2022-07-19 23:40:17,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028049864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:17,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:17,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:40:17,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164082175] [2022-07-19 23:40:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:17,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:40:17,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:40:17,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:40:17,890 INFO L87 Difference]: Start difference. First operand 13416 states and 19419 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 23:40:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:22,536 INFO L93 Difference]: Finished difference Result 28720 states and 42214 transitions. [2022-07-19 23:40:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 23:40:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 208 [2022-07-19 23:40:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:22,599 INFO L225 Difference]: With dead ends: 28720 [2022-07-19 23:40:22,600 INFO L226 Difference]: Without dead ends: 15316 [2022-07-19 23:40:22,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:40:22,654 INFO L413 NwaCegarLoop]: 1611 mSDtfsCounter, 424 mSDsluCounter, 4766 mSDsCounter, 0 mSdLazyCounter, 3135 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 6377 SdHoareTripleChecker+Invalid, 3431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 3135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:22,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 6377 Invalid, 3431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 3135 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-19 23:40:22,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15316 states. [2022-07-19 23:40:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15316 to 13456. [2022-07-19 23:40:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13456 states, 9937 states have (on average 1.3487974237697493) internal successors, (13403), 10128 states have internal predecessors, (13403), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 630 states have return successors, (3182), 2901 states have call predecessors, (3182), 2887 states have call successors, (3182) [2022-07-19 23:40:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13456 states to 13456 states and 19473 transitions. [2022-07-19 23:40:23,290 INFO L78 Accepts]: Start accepts. Automaton has 13456 states and 19473 transitions. Word has length 208 [2022-07-19 23:40:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:23,290 INFO L495 AbstractCegarLoop]: Abstraction has 13456 states and 19473 transitions. [2022-07-19 23:40:23,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (30), 4 states have call predecessors, (30), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 23:40:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 13456 states and 19473 transitions. [2022-07-19 23:40:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-19 23:40:23,371 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:23,372 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 7, 7, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:23,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 23:40:23,372 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:23,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:23,373 INFO L85 PathProgramCache]: Analyzing trace with hash -2029014981, now seen corresponding path program 1 times [2022-07-19 23:40:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:23,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560939367] [2022-07-19 23:40:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:23,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:40:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:40:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:40:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 23:40:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 23:40:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 23:40:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 23:40:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:40:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 23:40:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 23:40:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 23:40:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 23:40:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:40:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:40:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:40:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:40:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:23,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:40:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-19 23:40:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 23:40:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 23:40:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 23:40:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 23:40:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 23:40:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-19 23:40:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 23:40:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:24,205 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 486 trivial. 0 not checked. [2022-07-19 23:40:24,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:24,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560939367] [2022-07-19 23:40:24,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560939367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:24,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:24,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 23:40:24,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546642556] [2022-07-19 23:40:24,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:24,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 23:40:24,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:24,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 23:40:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2022-07-19 23:40:24,208 INFO L87 Difference]: Start difference. First operand 13456 states and 19473 transitions. Second operand has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-19 23:40:33,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:33,426 INFO L93 Difference]: Finished difference Result 30395 states and 44714 transitions. [2022-07-19 23:40:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-19 23:40:33,427 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) Word has length 215 [2022-07-19 23:40:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:33,486 INFO L225 Difference]: With dead ends: 30395 [2022-07-19 23:40:33,487 INFO L226 Difference]: Without dead ends: 16951 [2022-07-19 23:40:33,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-07-19 23:40:33,534 INFO L413 NwaCegarLoop]: 1708 mSDtfsCounter, 504 mSDsluCounter, 15534 mSDsCounter, 0 mSdLazyCounter, 7996 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 17242 SdHoareTripleChecker+Invalid, 8295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 7996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:33,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 17242 Invalid, 8295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 7996 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-07-19 23:40:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16951 states. [2022-07-19 23:40:34,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16951 to 13536. [2022-07-19 23:40:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13536 states, 10007 states have (on average 1.3433596482462276) internal successors, (13443), 10188 states have internal predecessors, (13443), 2888 states have call successors, (2888), 576 states have call predecessors, (2888), 640 states have return successors, (3202), 2921 states have call predecessors, (3202), 2887 states have call successors, (3202) [2022-07-19 23:40:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13536 states to 13536 states and 19533 transitions. [2022-07-19 23:40:34,218 INFO L78 Accepts]: Start accepts. Automaton has 13536 states and 19533 transitions. Word has length 215 [2022-07-19 23:40:34,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:34,219 INFO L495 AbstractCegarLoop]: Abstraction has 13536 states and 19533 transitions. [2022-07-19 23:40:34,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.8) internal successors, (102), 11 states have internal predecessors, (102), 3 states have call successors, (31), 4 states have call predecessors, (31), 5 states have return successors, (30), 5 states have call predecessors, (30), 3 states have call successors, (30) [2022-07-19 23:40:34,219 INFO L276 IsEmpty]: Start isEmpty. Operand 13536 states and 19533 transitions. [2022-07-19 23:40:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-19 23:40:34,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:34,246 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:34,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 23:40:34,246 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:34,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1853804592, now seen corresponding path program 1 times [2022-07-19 23:40:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:34,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971896347] [2022-07-19 23:40:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:40:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:34,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:40:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:40:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-19 23:40:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:40:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:40:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:40:34,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:40:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:40:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:40:34,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:40:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:40:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 23:40:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:40:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:40:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:40:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:40:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:40:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:40:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 23:40:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:40:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 23:40:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 23:40:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:40:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:40:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:40:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 23:40:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 23:40:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:34,659 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2022-07-19 23:40:34,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:34,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971896347] [2022-07-19 23:40:34,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971896347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:34,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:34,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 23:40:34,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506444652] [2022-07-19 23:40:34,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:34,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 23:40:34,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:34,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 23:40:34,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 23:40:34,661 INFO L87 Difference]: Start difference. First operand 13536 states and 19533 transitions. Second operand has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-19 23:40:42,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:42,147 INFO L93 Difference]: Finished difference Result 45858 states and 67578 transitions. [2022-07-19 23:40:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 23:40:42,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-07-19 23:40:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:42,312 INFO L225 Difference]: With dead ends: 45858 [2022-07-19 23:40:42,313 INFO L226 Difference]: Without dead ends: 32334 [2022-07-19 23:40:42,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-19 23:40:42,349 INFO L413 NwaCegarLoop]: 2243 mSDtfsCounter, 2275 mSDsluCounter, 5204 mSDsCounter, 0 mSdLazyCounter, 5162 mSolverCounterSat, 912 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 7447 SdHoareTripleChecker+Invalid, 6074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 912 IncrementalHoareTripleChecker+Valid, 5162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:42,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 7447 Invalid, 6074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [912 Valid, 5162 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-19 23:40:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32334 states. [2022-07-19 23:40:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32334 to 25796. [2022-07-19 23:40:43,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25796 states, 19254 states have (on average 1.3418510439389217) internal successors, (25836), 19600 states have internal predecessors, (25836), 5291 states have call successors, (5291), 1121 states have call predecessors, (5291), 1250 states have return successors, (5856), 5374 states have call predecessors, (5856), 5290 states have call successors, (5856) [2022-07-19 23:40:43,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25796 states to 25796 states and 36983 transitions. [2022-07-19 23:40:43,635 INFO L78 Accepts]: Start accepts. Automaton has 25796 states and 36983 transitions. Word has length 309 [2022-07-19 23:40:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:43,636 INFO L495 AbstractCegarLoop]: Abstraction has 25796 states and 36983 transitions. [2022-07-19 23:40:43,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.714285714285715) internal successors, (187), 4 states have internal predecessors, (187), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-19 23:40:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 25796 states and 36983 transitions. [2022-07-19 23:40:43,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-19 23:40:43,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:43,667 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:43,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 23:40:43,668 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:43,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:43,668 INFO L85 PathProgramCache]: Analyzing trace with hash 209812636, now seen corresponding path program 1 times [2022-07-19 23:40:43,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:43,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967345301] [2022-07-19 23:40:43,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:43,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:40:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:40:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:40:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:40:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:40:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:40:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:40:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:40:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:40:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:40:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:40:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:40:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 23:40:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:40:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:43,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:40:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:40:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:40:44,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:40:44,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:40:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 23:40:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:40:44,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 23:40:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 23:40:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:40:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:40:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:40:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 23:40:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 23:40:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-19 23:40:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:44,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967345301] [2022-07-19 23:40:44,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967345301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:44,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:44,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:40:44,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037303954] [2022-07-19 23:40:44,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:44,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:40:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:44,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:40:44,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:40:44,072 INFO L87 Difference]: Start difference. First operand 25796 states and 36983 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-19 23:40:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:49,147 INFO L93 Difference]: Finished difference Result 60524 states and 88845 transitions. [2022-07-19 23:40:49,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:40:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 309 [2022-07-19 23:40:49,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:49,339 INFO L225 Difference]: With dead ends: 60524 [2022-07-19 23:40:49,339 INFO L226 Difference]: Without dead ends: 34740 [2022-07-19 23:40:49,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:40:49,392 INFO L413 NwaCegarLoop]: 1632 mSDtfsCounter, 1198 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 2166 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:49,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 4103 Invalid, 2889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2166 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-19 23:40:49,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34740 states. [2022-07-19 23:40:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34740 to 26996. [2022-07-19 23:40:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26996 states, 20254 states have (on average 1.3526217043546953) internal successors, (27396), 20620 states have internal predecessors, (27396), 5491 states have call successors, (5491), 1121 states have call predecessors, (5491), 1250 states have return successors, (6056), 5574 states have call predecessors, (6056), 5490 states have call successors, (6056) [2022-07-19 23:40:50,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26996 states to 26996 states and 38943 transitions. [2022-07-19 23:40:50,783 INFO L78 Accepts]: Start accepts. Automaton has 26996 states and 38943 transitions. Word has length 309 [2022-07-19 23:40:50,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:50,783 INFO L495 AbstractCegarLoop]: Abstraction has 26996 states and 38943 transitions. [2022-07-19 23:40:50,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 2 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-19 23:40:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 26996 states and 38943 transitions. [2022-07-19 23:40:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-19 23:40:50,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:50,817 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:50,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 23:40:50,818 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:50,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -429672610, now seen corresponding path program 1 times [2022-07-19 23:40:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:50,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110939153] [2022-07-19 23:40:50,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:50,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:50,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:40:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:50,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:40:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:40:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:50,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:40:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:40:51,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:40:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:40:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:40:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:40:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:40:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:40:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:40:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 23:40:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:40:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:40:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:40:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:40:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:40:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:40:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 23:40:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:40:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 23:40:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 23:40:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:40:51,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:40:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:40:51,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 23:40:51,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 23:40:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-19 23:40:51,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:51,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110939153] [2022-07-19 23:40:51,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110939153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:51,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:51,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:40:51,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122352349] [2022-07-19 23:40:51,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:51,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:40:51,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:51,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:40:51,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:40:51,377 INFO L87 Difference]: Start difference. First operand 26996 states and 38943 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-19 23:40:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:40:57,251 INFO L93 Difference]: Finished difference Result 61744 states and 90795 transitions. [2022-07-19 23:40:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:40:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-07-19 23:40:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:40:57,351 INFO L225 Difference]: With dead ends: 61744 [2022-07-19 23:40:57,351 INFO L226 Difference]: Without dead ends: 34760 [2022-07-19 23:40:57,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:40:57,408 INFO L413 NwaCegarLoop]: 1560 mSDtfsCounter, 714 mSDsluCounter, 2866 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 4426 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:40:57,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 4426 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-19 23:40:57,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34760 states. [2022-07-19 23:40:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34760 to 27596. [2022-07-19 23:40:58,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27596 states, 20794 states have (on average 1.3588535154371453) internal successors, (28256), 21160 states have internal predecessors, (28256), 5551 states have call successors, (5551), 1121 states have call predecessors, (5551), 1250 states have return successors, (6116), 5634 states have call predecessors, (6116), 5550 states have call successors, (6116) [2022-07-19 23:40:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27596 states to 27596 states and 39923 transitions. [2022-07-19 23:40:58,809 INFO L78 Accepts]: Start accepts. Automaton has 27596 states and 39923 transitions. Word has length 309 [2022-07-19 23:40:58,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:40:58,810 INFO L495 AbstractCegarLoop]: Abstraction has 27596 states and 39923 transitions. [2022-07-19 23:40:58,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-19 23:40:58,811 INFO L276 IsEmpty]: Start isEmpty. Operand 27596 states and 39923 transitions. [2022-07-19 23:40:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-19 23:40:58,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:40:58,851 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 7, 7, 6, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:40:58,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 23:40:58,851 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:40:58,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:40:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -145687072, now seen corresponding path program 1 times [2022-07-19 23:40:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:40:58,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346345167] [2022-07-19 23:40:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:40:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:40:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:40:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:40:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:40:59,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:40:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:40:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:40:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:40:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:40:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:40:59,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:40:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:40:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:40:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:40:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 23:40:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 23:40:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-19 23:40:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:40:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:40:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:40:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:40:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:40:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:40:59,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:40:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 23:40:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:40:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 23:40:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 23:40:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:40:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:40:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:40:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 23:40:59,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 23:40:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:40:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-07-19 23:40:59,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:40:59,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346345167] [2022-07-19 23:40:59,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346345167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:40:59,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:40:59,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:40:59,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356700919] [2022-07-19 23:40:59,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:40:59,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:40:59,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:40:59,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:40:59,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:40:59,439 INFO L87 Difference]: Start difference. First operand 27596 states and 39923 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-19 23:41:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:04,225 INFO L93 Difference]: Finished difference Result 62004 states and 91175 transitions. [2022-07-19 23:41:04,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 23:41:04,226 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) Word has length 309 [2022-07-19 23:41:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:04,362 INFO L225 Difference]: With dead ends: 62004 [2022-07-19 23:41:04,363 INFO L226 Difference]: Without dead ends: 34420 [2022-07-19 23:41:04,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:41:04,442 INFO L413 NwaCegarLoop]: 1583 mSDtfsCounter, 1093 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 695 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1192 SdHoareTripleChecker+Valid, 3922 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 695 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:04,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1192 Valid, 3922 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [695 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-19 23:41:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34420 states. [2022-07-19 23:41:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34420 to 27596. [2022-07-19 23:41:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27596 states, 20794 states have (on average 1.3550062518034047) internal successors, (28176), 21160 states have internal predecessors, (28176), 5551 states have call successors, (5551), 1121 states have call predecessors, (5551), 1250 states have return successors, (6116), 5634 states have call predecessors, (6116), 5550 states have call successors, (6116) [2022-07-19 23:41:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27596 states to 27596 states and 39843 transitions. [2022-07-19 23:41:05,787 INFO L78 Accepts]: Start accepts. Automaton has 27596 states and 39843 transitions. Word has length 309 [2022-07-19 23:41:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:05,787 INFO L495 AbstractCegarLoop]: Abstraction has 27596 states and 39843 transitions. [2022-07-19 23:41:05,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 3 states have internal predecessors, (185), 3 states have call successors, (36), 5 states have call predecessors, (36), 2 states have return successors, (35), 3 states have call predecessors, (35), 3 states have call successors, (35) [2022-07-19 23:41:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 27596 states and 39843 transitions. [2022-07-19 23:41:05,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-07-19 23:41:05,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:05,821 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 7, 7, 6, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:05,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 23:41:05,821 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:05,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:05,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1138629090, now seen corresponding path program 1 times [2022-07-19 23:41:05,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:05,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483630686] [2022-07-19 23:41:05,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:05,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:05,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:05,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:41:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:05,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:41:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:05,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 23:41:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:06,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:41:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:41:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:41:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:41:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:41:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 23:41:06,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:41:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 23:41:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 23:41:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:41:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:41:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:41:06,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:41:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:41:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 23:41:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:41:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 23:41:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 23:41:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:41:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:41:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:41:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 23:41:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-19 23:41:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-19 23:41:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-19 23:41:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2022-07-19 23:41:06,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:06,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483630686] [2022-07-19 23:41:06,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483630686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:06,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:41:06,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 23:41:06,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951426484] [2022-07-19 23:41:06,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:06,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 23:41:06,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:06,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 23:41:06,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-19 23:41:06,208 INFO L87 Difference]: Start difference. First operand 27596 states and 39843 transitions. Second operand has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-19 23:41:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:14,328 INFO L93 Difference]: Finished difference Result 62559 states and 91271 transitions. [2022-07-19 23:41:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 23:41:14,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 314 [2022-07-19 23:41:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:14,419 INFO L225 Difference]: With dead ends: 62559 [2022-07-19 23:41:14,419 INFO L226 Difference]: Without dead ends: 34975 [2022-07-19 23:41:14,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-07-19 23:41:14,472 INFO L413 NwaCegarLoop]: 1917 mSDtfsCounter, 2188 mSDsluCounter, 5299 mSDsCounter, 0 mSdLazyCounter, 4311 mSolverCounterSat, 1373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2346 SdHoareTripleChecker+Valid, 7216 SdHoareTripleChecker+Invalid, 5684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1373 IncrementalHoareTripleChecker+Valid, 4311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:14,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2346 Valid, 7216 Invalid, 5684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1373 Valid, 4311 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2022-07-19 23:41:14,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34975 states. [2022-07-19 23:41:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34975 to 29188. [2022-07-19 23:41:15,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29188 states, 21983 states have (on average 1.3436291679934496) internal successors, (29537), 22387 states have internal predecessors, (29537), 5795 states have call successors, (5795), 1251 states have call predecessors, (5795), 1409 states have return successors, (6448), 5915 states have call predecessors, (6448), 5794 states have call successors, (6448) [2022-07-19 23:41:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29188 states to 29188 states and 41780 transitions. [2022-07-19 23:41:15,743 INFO L78 Accepts]: Start accepts. Automaton has 29188 states and 41780 transitions. Word has length 314 [2022-07-19 23:41:15,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:15,743 INFO L495 AbstractCegarLoop]: Abstraction has 29188 states and 41780 transitions. [2022-07-19 23:41:15,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.0) internal successors, (184), 5 states have internal predecessors, (184), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-19 23:41:15,744 INFO L276 IsEmpty]: Start isEmpty. Operand 29188 states and 41780 transitions. [2022-07-19 23:41:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2022-07-19 23:41:15,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:15,776 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 7, 7, 6, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:15,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 23:41:15,777 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash -733109948, now seen corresponding path program 1 times [2022-07-19 23:41:15,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:15,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027377499] [2022-07-19 23:41:15,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:15,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:15,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:41:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:41:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:15,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:41:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:15,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:41:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:15,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:41:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:41:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:41:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:41:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:41:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:41:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 23:41:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:41:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 23:41:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 23:41:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:41:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:41:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:41:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:41:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:41:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 23:41:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:41:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-19 23:41:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 23:41:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 23:41:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 23:41:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-19 23:41:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 23:41:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-19 23:41:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2022-07-19 23:41:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:16,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027377499] [2022-07-19 23:41:16,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027377499] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 23:41:16,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 23:41:16,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 23:41:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347589122] [2022-07-19 23:41:16,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 23:41:16,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 23:41:16,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:16,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 23:41:16,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 23:41:16,274 INFO L87 Difference]: Start difference. First operand 29188 states and 41780 transitions. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-19 23:41:21,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 23:41:21,360 INFO L93 Difference]: Finished difference Result 64166 states and 93583 transitions. [2022-07-19 23:41:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 23:41:21,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 314 [2022-07-19 23:41:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 23:41:21,471 INFO L225 Difference]: With dead ends: 64166 [2022-07-19 23:41:21,471 INFO L226 Difference]: Without dead ends: 34990 [2022-07-19 23:41:21,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-19 23:41:21,547 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 652 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 2727 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 4331 SdHoareTripleChecker+Invalid, 3115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-19 23:41:21,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 4331 Invalid, 3115 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [388 Valid, 2727 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-19 23:41:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34990 states. [2022-07-19 23:41:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34990 to 29227. [2022-07-19 23:41:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29227 states, 22009 states have (on average 1.3414512244990686) internal successors, (29524), 22413 states have internal predecessors, (29524), 5808 states have call successors, (5808), 1251 states have call predecessors, (5808), 1409 states have return successors, (6461), 5928 states have call predecessors, (6461), 5807 states have call successors, (6461) [2022-07-19 23:41:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29227 states to 29227 states and 41793 transitions. [2022-07-19 23:41:22,966 INFO L78 Accepts]: Start accepts. Automaton has 29227 states and 41793 transitions. Word has length 314 [2022-07-19 23:41:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 23:41:22,966 INFO L495 AbstractCegarLoop]: Abstraction has 29227 states and 41793 transitions. [2022-07-19 23:41:22,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 3 states have internal predecessors, (186), 2 states have call successors, (37), 5 states have call predecessors, (37), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-19 23:41:22,967 INFO L276 IsEmpty]: Start isEmpty. Operand 29227 states and 41793 transitions. [2022-07-19 23:41:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2022-07-19 23:41:22,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 23:41:22,999 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 7, 7, 6, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 23:41:23,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 23:41:23,000 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 23:41:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 23:41:23,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1928465655, now seen corresponding path program 1 times [2022-07-19 23:41:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 23:41:23,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314307541] [2022-07-19 23:41:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:23,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 23:41:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:23,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 23:41:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:23,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:23,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:23,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 23:41:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:41:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:23,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 23:41:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 23:41:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-19 23:41:24,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-19 23:41:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 23:41:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-07-19 23:41:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 23:41:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 23:41:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 23:41:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 23:41:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 23:41:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-19 23:41:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 23:41:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:41:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 23:41:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 23:41:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 23:41:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 23:41:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 23:41:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 23:41:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-19 23:41:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 23:41:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-19 23:41:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 23:41:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 23:41:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-19 23:41:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 23:41:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 23:41:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-19 23:41:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-07-19 23:41:24,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 23:41:24,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314307541] [2022-07-19 23:41:24,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314307541] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 23:41:24,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941481592] [2022-07-19 23:41:24,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 23:41:24,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 23:41:24,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 23:41:24,968 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 23:41:24,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 23:41:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 23:41:26,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 136 conjunts are in the unsatisfiable core [2022-07-19 23:41:26,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 23:41:49,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 23:41:49,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 103 [2022-07-19 23:41:49,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 23:41:49,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 85 [2022-07-19 23:41:49,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-07-19 23:41:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 164 proven. 5 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-07-19 23:41:49,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 23:41:50,904 INFO L356 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-07-19 23:41:50,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2022-07-19 23:41:50,953 INFO L356 Elim1Store]: treesize reduction 6, result has 60.0 percent of original size [2022-07-19 23:41:50,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 13 [2022-07-19 23:41:50,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 23:41:50,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-07-19 23:41:51,125 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 8 proven. 67 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2022-07-19 23:41:51,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941481592] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 23:41:51,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 23:41:51,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 18] total 51 [2022-07-19 23:41:51,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300584853] [2022-07-19 23:41:51,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 23:41:51,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 23:41:51,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 23:41:51,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 23:41:51,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2410, Unknown=5, NotChecked=0, Total=2550 [2022-07-19 23:41:51,129 INFO L87 Difference]: Start difference. First operand 29227 states and 41793 transitions. Second operand has 51 states, 46 states have (on average 8.565217391304348) internal successors, (394), 37 states have internal predecessors, (394), 14 states have call successors, (98), 8 states have call predecessors, (98), 12 states have return successors, (91), 16 states have call predecessors, (91), 14 states have call successors, (91) [2022-07-19 23:42:05,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 23:42:55,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []