./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.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 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:24:46,074 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:24:46,076 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:24:46,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:24:46,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:24:46,112 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:24:46,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:24:46,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:24:46,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:24:46,122 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:24:46,123 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:24:46,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:24:46,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:24:46,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:24:46,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:24:46,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:24:46,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:24:46,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:24:46,135 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:24:46,139 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:24:46,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:24:46,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:24:46,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:24:46,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:24:46,156 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:24:46,157 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:24:46,157 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:24:46,159 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:24:46,159 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:24:46,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:24:46,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:24:46,160 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:24:46,161 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:24:46,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:24:46,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:24:46,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:24:46,164 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:24:46,164 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:24:46,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:24:46,165 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:24:46,166 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:24:46,169 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 03:24:46,197 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:24:46,198 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:24:46,199 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:24:46,199 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:24:46,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:24:46,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:24:46,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:24:46,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:24:46,201 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:24:46,201 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:24:46,202 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:24:46,202 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:24:46,202 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:24:46,202 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:24:46,202 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:24:46,202 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:24:46,202 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:24:46,203 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:24:46,203 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:24:46,203 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:24:46,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:24:46,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:24:46,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:24:46,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:24:46,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:24:46,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:24:46,204 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:24:46,204 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:24:46,204 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:24:46,204 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:24:46,204 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 -> 01d4ebb86f2bde0df0d47bbd5d9b632b620f2501e68770553e85fb2bb5a7d15a [2021-12-28 03:24:46,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:24:46,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:24:46,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:24:46,503 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:24:46,504 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:24:46,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-28 03:24:46,547 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee66192f4/7e8ba00a5e464b1bb76c27062bdf903e/FLAG319eee2e5 [2021-12-28 03:24:47,140 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:24:47,140 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-28 03:24:47,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee66192f4/7e8ba00a5e464b1bb76c27062bdf903e/FLAG319eee2e5 [2021-12-28 03:24:47,578 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee66192f4/7e8ba00a5e464b1bb76c27062bdf903e [2021-12-28 03:24:47,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:24:47,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:24:47,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:24:47,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:24:47,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:24:47,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:24:47" (1/1) ... [2021-12-28 03:24:47,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722b015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:47, skipping insertion in model container [2021-12-28 03:24:47,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:24:47" (1/1) ... [2021-12-28 03:24:47,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:24:47,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:24:48,431 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-12-28 03:24:48,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:24:48,478 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:24:48,656 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.0/usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i[191320,191333] [2021-12-28 03:24:48,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:24:48,792 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:24:48,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48 WrapperNode [2021-12-28 03:24:48,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:24:48,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:24:48,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:24:48,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:24:48,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:48,858 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:48,918 INFO L137 Inliner]: procedures = 133, calls = 733, calls flagged for inlining = 54, calls inlined = 44, statements flattened = 1375 [2021-12-28 03:24:48,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:24:48,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:24:48,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:24:48,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:24:48,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:48,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:48,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:48,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:48,974 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:48,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:48,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:49,012 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:24:49,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:24:49,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:24:49,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:24:49,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (1/1) ... [2021-12-28 03:24:49,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:24:49,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:24:49,052 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) [2021-12-28 03:24:49,076 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 [2021-12-28 03:24:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2021-12-28 03:24:49,096 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2021-12-28 03:24:49,096 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_init [2021-12-28 03:24:49,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_init [2021-12-28 03:24:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-28 03:24:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2021-12-28 03:24:49,097 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2021-12-28 03:24:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-28 03:24:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-28 03:24:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:24:49,097 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-12-28 03:24:49,097 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-12-28 03:24:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_control_cmd [2021-12-28 03:24:49,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_control_cmd [2021-12-28 03:24:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-28 03:24:49,098 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-28 03:24:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 03:24:49,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 03:24:49,098 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_exit [2021-12-28 03:24:49,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_exit [2021-12-28 03:24:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_anchored_urbs [2021-12-28 03:24:49,099 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_anchored_urbs [2021-12-28 03:24:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-28 03:24:49,099 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-28 03:24:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure init_usb_anchor [2021-12-28 03:24:49,099 INFO L138 BoogieDeclarations]: Found implementation of procedure init_usb_anchor [2021-12-28 03:24:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 03:24:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2021-12-28 03:24:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2021-12-28 03:24:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-28 03:24:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-28 03:24:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-12-28 03:24:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-12-28 03:24:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-28 03:24:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-28 03:24:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_command_msg [2021-12-28 03:24:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_command_msg [2021-12-28 03:24:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:24:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure unlink_all_urbs [2021-12-28 03:24:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure unlink_all_urbs [2021-12-28 03:24:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:24:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure consume_skb [2021-12-28 03:24:49,101 INFO L138 BoogieDeclarations]: Found implementation of procedure consume_skb [2021-12-28 03:24:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 03:24:49,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 03:24:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure ems_usb_write_mode [2021-12-28 03:24:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ems_usb_write_mode [2021-12-28 03:24:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2021-12-28 03:24:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2021-12-28 03:24:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2021-12-28 03:24:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2021-12-28 03:24:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 03:24:49,102 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2021-12-28 03:24:49,102 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2021-12-28 03:24:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-28 03:24:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-28 03:24:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2021-12-28 03:24:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2021-12-28 03:24:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-28 03:24:49,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-28 03:24:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 03:24:49,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 03:24:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2021-12-28 03:24:49,104 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2021-12-28 03:24:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure netif_device_detach [2021-12-28 03:24:49,104 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_device_detach [2021-12-28 03:24:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-28 03:24:49,104 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-28 03:24:49,104 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2021-12-28 03:24:49,104 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2021-12-28 03:24:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-28 03:24:49,105 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-28 03:24:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-28 03:24:49,105 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-28 03:24:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-28 03:24:49,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-28 03:24:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure close_candev [2021-12-28 03:24:49,105 INFO L138 BoogieDeclarations]: Found implementation of procedure close_candev [2021-12-28 03:24:49,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:24:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure free_candev [2021-12-28 03:24:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure free_candev [2021-12-28 03:24:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2021-12-28 03:24:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2021-12-28 03:24:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-28 03:24:49,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:24:49,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:24:49,351 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:24:49,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:24:49,675 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-28 03:24:49,795 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-28 03:24:50,995 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2021-12-28 03:24:50,995 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2021-12-28 03:24:51,021 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:24:51,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:24:51,029 INFO L299 CfgBuilder]: Removed 13 assume(true) statements. [2021-12-28 03:24:51,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:24:51 BoogieIcfgContainer [2021-12-28 03:24:51,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:24:51,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:24:51,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:24:51,051 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:24:51,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:24:47" (1/3) ... [2021-12-28 03:24:51,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3696c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:24:51, skipping insertion in model container [2021-12-28 03:24:51,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:24:48" (2/3) ... [2021-12-28 03:24:51,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3696c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:24:51, skipping insertion in model container [2021-12-28 03:24:51,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:24:51" (3/3) ... [2021-12-28 03:24:51,054 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-can-usb-ems_usb.ko.cil.out.i [2021-12-28 03:24:51,058 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:24:51,058 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:24:51,103 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:24:51,110 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 03:24:51,111 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 03:24:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) [2021-12-28 03:24:51,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-28 03:24:51,146 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:51,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:24:51,147 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:51,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1517292025, now seen corresponding path program 1 times [2021-12-28 03:24:51,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:51,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494350427] [2021-12-28 03:24:51,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:51,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:51,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:51,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:51,527 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:51,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494350427] [2021-12-28 03:24:51,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494350427] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:51,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:51,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:24:51,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761717034] [2021-12-28 03:24:51,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:51,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:24:51,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:51,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:24:51,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:24:51,564 INFO L87 Difference]: Start difference. First operand has 431 states, 304 states have (on average 1.3519736842105263) internal successors, (411), 316 states have internal predecessors, (411), 91 states have call successors, (91), 35 states have call predecessors, (91), 34 states have return successors, (89), 87 states have call predecessors, (89), 89 states have call successors, (89) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 03:24:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:51,703 INFO L93 Difference]: Finished difference Result 1253 states and 1768 transitions. [2021-12-28 03:24:51,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:24:51,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-12-28 03:24:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:51,722 INFO L225 Difference]: With dead ends: 1253 [2021-12-28 03:24:51,722 INFO L226 Difference]: Without dead ends: 824 [2021-12-28 03:24:51,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:24:51,735 INFO L933 BasicCegarLoop]: 695 mSDtfsCounter, 545 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:51,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 1229 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2021-12-28 03:24:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 820. [2021-12-28 03:24:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 581 states have (on average 1.2581755593803787) internal successors, (731), 593 states have internal predecessors, (731), 173 states have call successors, (173), 66 states have call predecessors, (173), 65 states have return successors, (172), 165 states have call predecessors, (172), 169 states have call successors, (172) [2021-12-28 03:24:51,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1076 transitions. [2021-12-28 03:24:51,845 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1076 transitions. Word has length 16 [2021-12-28 03:24:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:51,846 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1076 transitions. [2021-12-28 03:24:51,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 03:24:51,846 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1076 transitions. [2021-12-28 03:24:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-28 03:24:51,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:51,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:24:51,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:24:51,847 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:51,850 INFO L85 PathProgramCache]: Analyzing trace with hash 208359179, now seen corresponding path program 1 times [2021-12-28 03:24:51,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:51,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455057709] [2021-12-28 03:24:51,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:51,851 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:51,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:51,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455057709] [2021-12-28 03:24:51,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455057709] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:51,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:51,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:24:51,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670308291] [2021-12-28 03:24:51,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:51,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:24:51,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:51,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:24:51,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:24:51,958 INFO L87 Difference]: Start difference. First operand 820 states and 1076 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 03:24:52,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:52,020 INFO L93 Difference]: Finished difference Result 2433 states and 3207 transitions. [2021-12-28 03:24:52,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:24:52,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-12-28 03:24:52,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:52,027 INFO L225 Difference]: With dead ends: 2433 [2021-12-28 03:24:52,027 INFO L226 Difference]: Without dead ends: 1617 [2021-12-28 03:24:52,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:24:52,030 INFO L933 BasicCegarLoop]: 630 mSDtfsCounter, 535 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:52,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [535 Valid, 1161 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:24:52,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1617 states. [2021-12-28 03:24:52,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1610. [2021-12-28 03:24:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2541630148992111) internal successors, (1431), 1160 states have internal predecessors, (1431), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2021-12-28 03:24:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2021-12-28 03:24:52,076 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 17 [2021-12-28 03:24:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:52,077 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2021-12-28 03:24:52,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-28 03:24:52,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2021-12-28 03:24:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-28 03:24:52,096 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:52,097 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:24:52,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:24:52,097 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash 26582145, now seen corresponding path program 1 times [2021-12-28 03:24:52,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:52,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304303510] [2021-12-28 03:24:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:52,098 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:52,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:24:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 03:24:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 03:24:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 03:24:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:24:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:24:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 03:24:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:24:52,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:52,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304303510] [2021-12-28 03:24:52,270 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304303510] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:52,270 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:52,270 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 03:24:52,270 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148369143] [2021-12-28 03:24:52,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:52,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 03:24:52,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:52,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 03:24:52,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:24:52,272 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:54,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:54,323 INFO L93 Difference]: Finished difference Result 3324 states and 4411 transitions. [2021-12-28 03:24:54,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 03:24:54,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-12-28 03:24:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:54,331 INFO L225 Difference]: With dead ends: 3324 [2021-12-28 03:24:54,332 INFO L226 Difference]: Without dead ends: 1722 [2021-12-28 03:24:54,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:24:54,336 INFO L933 BasicCegarLoop]: 528 mSDtfsCounter, 235 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:54,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 1966 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 962 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 03:24:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-12-28 03:24:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1610. [2021-12-28 03:24:54,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1141 states have (on average 1.2532865907099036) internal successors, (1430), 1160 states have internal predecessors, (1430), 340 states have call successors, (340), 129 states have call predecessors, (340), 128 states have return successors, (346), 328 states have call predecessors, (346), 336 states have call successors, (346) [2021-12-28 03:24:54,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2116 transitions. [2021-12-28 03:24:54,382 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2116 transitions. Word has length 71 [2021-12-28 03:24:54,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:54,383 INFO L470 AbstractCegarLoop]: Abstraction has 1610 states and 2116 transitions. [2021-12-28 03:24:54,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2116 transitions. [2021-12-28 03:24:54,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-28 03:24:54,385 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:54,385 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:24:54,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 03:24:54,386 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:54,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:54,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2146869344, now seen corresponding path program 1 times [2021-12-28 03:24:54,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:54,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775230749] [2021-12-28 03:24:54,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:54,387 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2021-12-28 03:24:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 03:24:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 03:24:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 03:24:54,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:24:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:24:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 03:24:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:54,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:24:54,565 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:54,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775230749] [2021-12-28 03:24:54,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775230749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:54,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:54,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:24:54,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914141034] [2021-12-28 03:24:54,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:54,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:24:54,566 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:24:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:24:54,567 INFO L87 Difference]: Start difference. First operand 1610 states and 2116 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:56,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:56,933 INFO L93 Difference]: Finished difference Result 4036 states and 5567 transitions. [2021-12-28 03:24:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:24:56,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2021-12-28 03:24:56,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:56,944 INFO L225 Difference]: With dead ends: 4036 [2021-12-28 03:24:56,944 INFO L226 Difference]: Without dead ends: 2437 [2021-12-28 03:24:56,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:24:56,965 INFO L933 BasicCegarLoop]: 603 mSDtfsCounter, 437 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:56,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 1373 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-28 03:24:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2021-12-28 03:24:57,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2313. [2021-12-28 03:24:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 1640 states have (on average 1.2939024390243903) internal successors, (2122), 1675 states have internal predecessors, (2122), 544 states have call successors, (544), 129 states have call predecessors, (544), 128 states have return successors, (558), 524 states have call predecessors, (558), 540 states have call successors, (558) [2021-12-28 03:24:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3224 transitions. [2021-12-28 03:24:57,046 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3224 transitions. Word has length 71 [2021-12-28 03:24:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:57,046 INFO L470 AbstractCegarLoop]: Abstraction has 2313 states and 3224 transitions. [2021-12-28 03:24:57,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2021-12-28 03:24:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3224 transitions. [2021-12-28 03:24:57,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-28 03:24:57,048 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:57,049 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:24:57,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:24:57,049 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:57,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:57,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1152569613, now seen corresponding path program 1 times [2021-12-28 03:24:57,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:57,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750142521] [2021-12-28 03:24:57,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:57,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 03:24:57,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:24:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2021-12-28 03:24:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-28 03:24:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:57,229 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:57,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:57,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750142521] [2021-12-28 03:24:57,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750142521] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:57,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:57,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:24:57,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842861133] [2021-12-28 03:24:57,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:57,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:24:57,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:57,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:24:57,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:24:57,231 INFO L87 Difference]: Start difference. First operand 2313 states and 3224 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:24:58,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:58,024 INFO L93 Difference]: Finished difference Result 6341 states and 9294 transitions. [2021-12-28 03:24:58,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:24:58,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2021-12-28 03:24:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:58,058 INFO L225 Difference]: With dead ends: 6341 [2021-12-28 03:24:58,058 INFO L226 Difference]: Without dead ends: 4040 [2021-12-28 03:24:58,066 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:24:58,067 INFO L933 BasicCegarLoop]: 867 mSDtfsCounter, 564 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:58,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 2626 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 03:24:58,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2021-12-28 03:24:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 2347. [2021-12-28 03:24:58,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1668 states have (on average 1.290167865707434) internal successors, (2152), 1705 states have internal predecessors, (2152), 544 states have call successors, (544), 129 states have call predecessors, (544), 134 states have return successors, (580), 528 states have call predecessors, (580), 540 states have call successors, (580) [2021-12-28 03:24:58,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3276 transitions. [2021-12-28 03:24:58,187 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3276 transitions. Word has length 68 [2021-12-28 03:24:58,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:58,187 INFO L470 AbstractCegarLoop]: Abstraction has 2347 states and 3276 transitions. [2021-12-28 03:24:58,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:24:58,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3276 transitions. [2021-12-28 03:24:58,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-28 03:24:58,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:58,190 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:24:58,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 03:24:58,191 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:58,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:58,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1776712988, now seen corresponding path program 1 times [2021-12-28 03:24:58,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:58,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911861183] [2021-12-28 03:24:58,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:58,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:24:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:24:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:24:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:24:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:58,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:58,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911861183] [2021-12-28 03:24:58,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911861183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:58,334 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:58,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:24:58,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106915482] [2021-12-28 03:24:58,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:58,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:24:58,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:58,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:24:58,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:24:58,336 INFO L87 Difference]: Start difference. First operand 2347 states and 3276 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:24:59,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:24:59,171 INFO L93 Difference]: Finished difference Result 5919 states and 8590 transitions. [2021-12-28 03:24:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:24:59,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2021-12-28 03:24:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:24:59,190 INFO L225 Difference]: With dead ends: 5919 [2021-12-28 03:24:59,190 INFO L226 Difference]: Without dead ends: 3584 [2021-12-28 03:24:59,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:24:59,199 INFO L933 BasicCegarLoop]: 813 mSDtfsCounter, 453 mSDsluCounter, 1691 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 03:24:59,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [458 Valid, 2504 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 03:24:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3584 states. [2021-12-28 03:24:59,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 2363. [2021-12-28 03:24:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2363 states, 1684 states have (on average 1.2874109263657958) internal successors, (2168), 1721 states have internal predecessors, (2168), 544 states have call successors, (544), 129 states have call predecessors, (544), 134 states have return successors, (580), 528 states have call predecessors, (580), 540 states have call successors, (580) [2021-12-28 03:24:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2363 states to 2363 states and 3292 transitions. [2021-12-28 03:24:59,314 INFO L78 Accepts]: Start accepts. Automaton has 2363 states and 3292 transitions. Word has length 69 [2021-12-28 03:24:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:24:59,315 INFO L470 AbstractCegarLoop]: Abstraction has 2363 states and 3292 transitions. [2021-12-28 03:24:59,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:24:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 2363 states and 3292 transitions. [2021-12-28 03:24:59,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-28 03:24:59,317 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:24:59,317 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:24:59,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 03:24:59,318 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:24:59,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:24:59,318 INFO L85 PathProgramCache]: Analyzing trace with hash 676145405, now seen corresponding path program 1 times [2021-12-28 03:24:59,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:24:59,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001250341] [2021-12-28 03:24:59,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:24:59,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:24:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:24:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:24:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:24:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:24:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:24:59,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:24:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:24:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:24:59,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:24:59,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:24:59,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001250341] [2021-12-28 03:24:59,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001250341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:24:59,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:24:59,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:24:59,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961891885] [2021-12-28 03:24:59,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:24:59,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:24:59,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:24:59,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:24:59,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:24:59,591 INFO L87 Difference]: Start difference. First operand 2363 states and 3292 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:25:00,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:00,839 INFO L93 Difference]: Finished difference Result 3619 states and 5113 transitions. [2021-12-28 03:25:00,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:25:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2021-12-28 03:25:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:00,852 INFO L225 Difference]: With dead ends: 3619 [2021-12-28 03:25:00,853 INFO L226 Difference]: Without dead ends: 2425 [2021-12-28 03:25:00,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:25:00,858 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 117 mSDsluCounter, 2300 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 2836 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:00,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 2836 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2021-12-28 03:25:00,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2425 states. [2021-12-28 03:25:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2425 to 2377. [2021-12-28 03:25:00,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2377 states, 1694 states have (on average 1.2845336481700118) internal successors, (2176), 1731 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 532 states have call predecessors, (592), 540 states have call successors, (592) [2021-12-28 03:25:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3312 transitions. [2021-12-28 03:25:00,957 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3312 transitions. Word has length 69 [2021-12-28 03:25:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:00,959 INFO L470 AbstractCegarLoop]: Abstraction has 2377 states and 3312 transitions. [2021-12-28 03:25:00,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:25:00,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3312 transitions. [2021-12-28 03:25:00,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-12-28 03:25:00,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:00,961 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:25:00,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 03:25:00,961 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:00,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:00,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1333958436, now seen corresponding path program 1 times [2021-12-28 03:25:00,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:00,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750554638] [2021-12-28 03:25:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:00,962 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:25:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:25:01,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:01,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750554638] [2021-12-28 03:25:01,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750554638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:01,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:01,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 03:25:01,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914314647] [2021-12-28 03:25:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:01,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 03:25:01,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:01,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 03:25:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:25:01,173 INFO L87 Difference]: Start difference. First operand 2377 states and 3312 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:25:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:02,930 INFO L93 Difference]: Finished difference Result 5577 states and 8014 transitions. [2021-12-28 03:25:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 03:25:02,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 69 [2021-12-28 03:25:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:02,943 INFO L225 Difference]: With dead ends: 5577 [2021-12-28 03:25:02,943 INFO L226 Difference]: Without dead ends: 3212 [2021-12-28 03:25:02,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:25:02,952 INFO L933 BasicCegarLoop]: 911 mSDtfsCounter, 448 mSDsluCounter, 5597 mSDsCounter, 0 mSdLazyCounter, 2246 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 6508 SdHoareTripleChecker+Invalid, 2435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:02,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 6508 Invalid, 2435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2246 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-28 03:25:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3212 states. [2021-12-28 03:25:03,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3212 to 2381. [2021-12-28 03:25:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2381 states, 1698 states have (on average 1.28150765606596) internal successors, (2176), 1733 states have internal predecessors, (2176), 544 states have call successors, (544), 129 states have call predecessors, (544), 138 states have return successors, (592), 534 states have call predecessors, (592), 540 states have call successors, (592) [2021-12-28 03:25:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2381 states to 2381 states and 3312 transitions. [2021-12-28 03:25:03,093 INFO L78 Accepts]: Start accepts. Automaton has 2381 states and 3312 transitions. Word has length 69 [2021-12-28 03:25:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:03,094 INFO L470 AbstractCegarLoop]: Abstraction has 2381 states and 3312 transitions. [2021-12-28 03:25:03,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 7 states have internal predecessors, (54), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:25:03,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2381 states and 3312 transitions. [2021-12-28 03:25:03,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-28 03:25:03,098 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:03,098 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:25:03,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 03:25:03,099 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:03,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1804654053, now seen corresponding path program 1 times [2021-12-28 03:25:03,099 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:03,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212750790] [2021-12-28 03:25:03,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:03,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:03,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 03:25:03,267 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:03,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212750790] [2021-12-28 03:25:03,267 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212750790] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:03,267 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:03,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 03:25:03,268 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545930711] [2021-12-28 03:25:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:03,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 03:25:03,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:03,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 03:25:03,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:25:03,269 INFO L87 Difference]: Start difference. First operand 2381 states and 3312 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:25:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:04,596 INFO L93 Difference]: Finished difference Result 5739 states and 8248 transitions. [2021-12-28 03:25:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 03:25:04,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 75 [2021-12-28 03:25:04,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:04,611 INFO L225 Difference]: With dead ends: 5739 [2021-12-28 03:25:04,611 INFO L226 Difference]: Without dead ends: 3370 [2021-12-28 03:25:04,617 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:25:04,618 INFO L933 BasicCegarLoop]: 814 mSDtfsCounter, 397 mSDsluCounter, 2860 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:04,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 3674 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2021-12-28 03:25:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3370 states. [2021-12-28 03:25:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3370 to 2179. [2021-12-28 03:25:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1560 states have (on average 1.2717948717948717) internal successors, (1984), 1579 states have internal predecessors, (1984), 480 states have call successors, (480), 127 states have call predecessors, (480), 138 states have return successors, (532), 480 states have call predecessors, (532), 476 states have call successors, (532) [2021-12-28 03:25:04,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 2996 transitions. [2021-12-28 03:25:04,761 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 2996 transitions. Word has length 75 [2021-12-28 03:25:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:04,762 INFO L470 AbstractCegarLoop]: Abstraction has 2179 states and 2996 transitions. [2021-12-28 03:25:04,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 3 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-28 03:25:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 2996 transitions. [2021-12-28 03:25:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2021-12-28 03:25:04,764 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:04,764 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:25:04,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 03:25:04,765 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:04,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:04,765 INFO L85 PathProgramCache]: Analyzing trace with hash -506709307, now seen corresponding path program 1 times [2021-12-28 03:25:04,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:04,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835640450] [2021-12-28 03:25:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:04,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 03:25:04,928 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:04,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835640450] [2021-12-28 03:25:04,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835640450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:04,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:04,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:25:04,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523545895] [2021-12-28 03:25:04,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:04,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:25:04,929 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:04,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:25:04,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:25:04,930 INFO L87 Difference]: Start difference. First operand 2179 states and 2996 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:25:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:06,964 INFO L93 Difference]: Finished difference Result 3452 states and 4818 transitions. [2021-12-28 03:25:06,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 03:25:06,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) Word has length 75 [2021-12-28 03:25:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:06,991 INFO L225 Difference]: With dead ends: 3452 [2021-12-28 03:25:06,991 INFO L226 Difference]: Without dead ends: 3447 [2021-12-28 03:25:06,993 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:25:06,994 INFO L933 BasicCegarLoop]: 919 mSDtfsCounter, 2406 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 1155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2520 SdHoareTripleChecker+Valid, 2309 SdHoareTripleChecker+Invalid, 2724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1155 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:06,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2520 Valid, 2309 Invalid, 2724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1155 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-28 03:25:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3447 states. [2021-12-28 03:25:07,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3447 to 3363. [2021-12-28 03:25:07,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3363 states, 2405 states have (on average 1.2752598752598752) internal successors, (3067), 2440 states have internal predecessors, (3067), 748 states have call successors, (748), 189 states have call predecessors, (748), 209 states have return successors, (870), 749 states have call predecessors, (870), 744 states have call successors, (870) [2021-12-28 03:25:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3363 states to 3363 states and 4685 transitions. [2021-12-28 03:25:07,126 INFO L78 Accepts]: Start accepts. Automaton has 3363 states and 4685 transitions. Word has length 75 [2021-12-28 03:25:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:07,127 INFO L470 AbstractCegarLoop]: Abstraction has 3363 states and 4685 transitions. [2021-12-28 03:25:07,127 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 6 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (7), 4 states have call predecessors, (7), 5 states have call successors, (7) [2021-12-28 03:25:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 3363 states and 4685 transitions. [2021-12-28 03:25:07,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 03:25:07,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:07,130 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:07,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 03:25:07,130 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:07,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash -9266808, now seen corresponding path program 1 times [2021-12-28 03:25:07,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:07,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660641757] [2021-12-28 03:25:07,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:07,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 03:25:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:25:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:07,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:25:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:25:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:25:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 03:25:07,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:07,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660641757] [2021-12-28 03:25:07,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660641757] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:07,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:07,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:25:07,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462403952] [2021-12-28 03:25:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:07,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:25:07,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:07,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:25:07,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:25:07,381 INFO L87 Difference]: Start difference. First operand 3363 states and 4685 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:25:08,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:08,483 INFO L93 Difference]: Finished difference Result 7643 states and 10959 transitions. [2021-12-28 03:25:08,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:25:08,484 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2021-12-28 03:25:08,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:08,497 INFO L225 Difference]: With dead ends: 7643 [2021-12-28 03:25:08,498 INFO L226 Difference]: Without dead ends: 4292 [2021-12-28 03:25:08,507 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:25:08,508 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 599 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:08,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [668 Valid, 2774 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-28 03:25:08,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2021-12-28 03:25:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2826. [2021-12-28 03:25:08,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2031 states have (on average 1.2737567700640078) internal successors, (2587), 2057 states have internal predecessors, (2587), 624 states have call successors, (624), 153 states have call predecessors, (624), 170 states have return successors, (730), 631 states have call predecessors, (730), 620 states have call successors, (730) [2021-12-28 03:25:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3941 transitions. [2021-12-28 03:25:08,629 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3941 transitions. Word has length 94 [2021-12-28 03:25:08,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:08,629 INFO L470 AbstractCegarLoop]: Abstraction has 2826 states and 3941 transitions. [2021-12-28 03:25:08,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 4 states have internal predecessors, (65), 3 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:25:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3941 transitions. [2021-12-28 03:25:08,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-28 03:25:08,631 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:08,631 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:08,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 03:25:08,632 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:08,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:08,632 INFO L85 PathProgramCache]: Analyzing trace with hash 564700489, now seen corresponding path program 1 times [2021-12-28 03:25:08,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:08,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693021638] [2021-12-28 03:25:08,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:08,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 03:25:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:25:08,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:25:08,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:25:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 03:25:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2021-12-28 03:25:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2021-12-28 03:25:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:08,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:25:08,898 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:08,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693021638] [2021-12-28 03:25:08,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693021638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:08,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:08,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-12-28 03:25:08,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595471779] [2021-12-28 03:25:08,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:08,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:25:08,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:08,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:25:08,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:25:08,900 INFO L87 Difference]: Start difference. First operand 2826 states and 3941 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:25:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:10,915 INFO L93 Difference]: Finished difference Result 6776 states and 9771 transitions. [2021-12-28 03:25:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 03:25:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2021-12-28 03:25:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:10,930 INFO L225 Difference]: With dead ends: 6776 [2021-12-28 03:25:10,930 INFO L226 Difference]: Without dead ends: 4370 [2021-12-28 03:25:10,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:25:10,940 INFO L933 BasicCegarLoop]: 803 mSDtfsCounter, 433 mSDsluCounter, 5168 mSDsCounter, 0 mSdLazyCounter, 2434 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 5971 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 2434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:10,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [519 Valid, 5971 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 2434 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-28 03:25:10,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2021-12-28 03:25:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 2826. [2021-12-28 03:25:11,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2826 states, 2031 states have (on average 1.2698178237321516) internal successors, (2579), 2057 states have internal predecessors, (2579), 624 states have call successors, (624), 153 states have call predecessors, (624), 170 states have return successors, (730), 631 states have call predecessors, (730), 620 states have call successors, (730) [2021-12-28 03:25:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2826 states to 2826 states and 3933 transitions. [2021-12-28 03:25:11,105 INFO L78 Accepts]: Start accepts. Automaton has 2826 states and 3933 transitions. Word has length 92 [2021-12-28 03:25:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:11,105 INFO L470 AbstractCegarLoop]: Abstraction has 2826 states and 3933 transitions. [2021-12-28 03:25:11,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:25:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2826 states and 3933 transitions. [2021-12-28 03:25:11,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-28 03:25:11,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:11,108 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:25:11,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 03:25:11,109 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:11,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:11,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1871827029, now seen corresponding path program 1 times [2021-12-28 03:25:11,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:11,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729136959] [2021-12-28 03:25:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:11,110 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:11,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:11,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:25:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 03:25:11,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:11,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729136959] [2021-12-28 03:25:11,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729136959] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:11,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:11,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 03:25:11,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821290504] [2021-12-28 03:25:11,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:11,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 03:25:11,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 03:25:11,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:25:11,286 INFO L87 Difference]: Start difference. First operand 2826 states and 3933 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-28 03:25:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:12,264 INFO L93 Difference]: Finished difference Result 6262 states and 9007 transitions. [2021-12-28 03:25:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:25:12,264 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2021-12-28 03:25:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:12,273 INFO L225 Difference]: With dead ends: 6262 [2021-12-28 03:25:12,274 INFO L226 Difference]: Without dead ends: 3856 [2021-12-28 03:25:12,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:25:12,278 INFO L933 BasicCegarLoop]: 811 mSDtfsCounter, 513 mSDsluCounter, 2008 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 2819 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:12,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [579 Valid, 2819 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-28 03:25:12,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3856 states. [2021-12-28 03:25:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3856 to 2636. [2021-12-28 03:25:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 1899 states have (on average 1.2622432859399684) internal successors, (2397), 1911 states have internal predecessors, (2397), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 585 states have call predecessors, (670), 564 states have call successors, (670) [2021-12-28 03:25:12,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3635 transitions. [2021-12-28 03:25:12,390 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3635 transitions. Word has length 87 [2021-12-28 03:25:12,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:12,390 INFO L470 AbstractCegarLoop]: Abstraction has 2636 states and 3635 transitions. [2021-12-28 03:25:12,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 4 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-28 03:25:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3635 transitions. [2021-12-28 03:25:12,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-28 03:25:12,392 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:12,393 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:25:12,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 03:25:12,393 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:12,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:12,393 INFO L85 PathProgramCache]: Analyzing trace with hash -205382314, now seen corresponding path program 1 times [2021-12-28 03:25:12,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:12,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845387058] [2021-12-28 03:25:12,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:12,394 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:25:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:25:12,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:12,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845387058] [2021-12-28 03:25:12,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845387058] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:12,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:12,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:25:12,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643299849] [2021-12-28 03:25:12,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:12,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:25:12,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:25:12,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:25:12,583 INFO L87 Difference]: Start difference. First operand 2636 states and 3635 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-28 03:25:13,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:13,713 INFO L93 Difference]: Finished difference Result 3905 states and 5433 transitions. [2021-12-28 03:25:13,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 03:25:13,713 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) Word has length 87 [2021-12-28 03:25:13,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:13,719 INFO L225 Difference]: With dead ends: 3905 [2021-12-28 03:25:13,719 INFO L226 Difference]: Without dead ends: 2681 [2021-12-28 03:25:13,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:25:13,723 INFO L933 BasicCegarLoop]: 526 mSDtfsCounter, 340 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:13,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 2516 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-28 03:25:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2021-12-28 03:25:13,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2644. [2021-12-28 03:25:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 1907 states have (on average 1.261143156790771) internal successors, (2405), 1915 states have internal predecessors, (2405), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 589 states have call predecessors, (670), 564 states have call successors, (670) [2021-12-28 03:25:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3643 transitions. [2021-12-28 03:25:13,836 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3643 transitions. Word has length 87 [2021-12-28 03:25:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:13,837 INFO L470 AbstractCegarLoop]: Abstraction has 2644 states and 3643 transitions. [2021-12-28 03:25:13,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-28 03:25:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3643 transitions. [2021-12-28 03:25:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-12-28 03:25:13,839 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:13,839 INFO L514 BasicCegarLoop]: trace histogram [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] [2021-12-28 03:25:13,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 03:25:13,839 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:13,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2079481141, now seen corresponding path program 1 times [2021-12-28 03:25:13,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:13,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514169692] [2021-12-28 03:25:13,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:13,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:25:13,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 03:25:13,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:13,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514169692] [2021-12-28 03:25:13,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514169692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:13,950 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:13,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:25:13,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482955242] [2021-12-28 03:25:13,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:13,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:25:13,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:25:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:25:13,951 INFO L87 Difference]: Start difference. First operand 2644 states and 3643 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-28 03:25:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:14,748 INFO L93 Difference]: Finished difference Result 4660 states and 6627 transitions. [2021-12-28 03:25:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:25:14,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 87 [2021-12-28 03:25:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:14,758 INFO L225 Difference]: With dead ends: 4660 [2021-12-28 03:25:14,758 INFO L226 Difference]: Without dead ends: 3432 [2021-12-28 03:25:14,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-28 03:25:14,763 INFO L933 BasicCegarLoop]: 834 mSDtfsCounter, 426 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:14,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 2115 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-28 03:25:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3432 states. [2021-12-28 03:25:14,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3432 to 2652. [2021-12-28 03:25:14,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 1915 states have (on average 1.2600522193211487) internal successors, (2413), 1923 states have internal predecessors, (2413), 568 states have call successors, (568), 151 states have call predecessors, (568), 168 states have return successors, (670), 589 states have call predecessors, (670), 564 states have call successors, (670) [2021-12-28 03:25:14,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3651 transitions. [2021-12-28 03:25:14,914 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3651 transitions. Word has length 87 [2021-12-28 03:25:14,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:14,914 INFO L470 AbstractCegarLoop]: Abstraction has 2652 states and 3651 transitions. [2021-12-28 03:25:14,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (10), 5 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2021-12-28 03:25:14,914 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3651 transitions. [2021-12-28 03:25:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 03:25:14,917 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:14,917 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:14,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 03:25:14,918 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:14,918 INFO L85 PathProgramCache]: Analyzing trace with hash 390816807, now seen corresponding path program 1 times [2021-12-28 03:25:14,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:14,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928626981] [2021-12-28 03:25:14,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:14,919 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:14,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:25:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:14,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-28 03:25:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:15,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2021-12-28 03:25:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:15,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-12-28 03:25:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:15,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-28 03:25:15,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:15,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2021-12-28 03:25:15,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:15,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:15,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:25:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:15,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 03:25:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-12-28 03:25:15,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:15,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928626981] [2021-12-28 03:25:15,033 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928626981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:15,033 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:15,033 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:25:15,034 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061638159] [2021-12-28 03:25:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:15,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:25:15,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:15,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:25:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:25:15,035 INFO L87 Difference]: Start difference. First operand 2652 states and 3651 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:25:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:17,982 INFO L93 Difference]: Finished difference Result 5424 states and 7473 transitions. [2021-12-28 03:25:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 03:25:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2021-12-28 03:25:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:17,991 INFO L225 Difference]: With dead ends: 5424 [2021-12-28 03:25:17,991 INFO L226 Difference]: Without dead ends: 2778 [2021-12-28 03:25:17,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:25:17,999 INFO L933 BasicCegarLoop]: 537 mSDtfsCounter, 247 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:17,999 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 1645 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2021-12-28 03:25:18,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2021-12-28 03:25:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2664. [2021-12-28 03:25:18,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 1923 states have (on average 1.2584503380135206) internal successors, (2420), 1931 states have internal predecessors, (2420), 570 states have call successors, (570), 153 states have call predecessors, (570), 170 states have return successors, (672), 591 states have call predecessors, (672), 566 states have call successors, (672) [2021-12-28 03:25:18,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3662 transitions. [2021-12-28 03:25:18,100 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3662 transitions. Word has length 94 [2021-12-28 03:25:18,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:18,101 INFO L470 AbstractCegarLoop]: Abstraction has 2664 states and 3662 transitions. [2021-12-28 03:25:18,101 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 3 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2021-12-28 03:25:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3662 transitions. [2021-12-28 03:25:18,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-28 03:25:18,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:18,103 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:18,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 03:25:18,103 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:18,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1118734186, now seen corresponding path program 1 times [2021-12-28 03:25:18,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005526935] [2021-12-28 03:25:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:18,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 03:25:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-28 03:25:18,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:18,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005526935] [2021-12-28 03:25:18,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005526935] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:18,323 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:18,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:25:18,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615771497] [2021-12-28 03:25:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:18,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:25:18,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:25:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:25:18,325 INFO L87 Difference]: Start difference. First operand 2664 states and 3662 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-28 03:25:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:20,239 INFO L93 Difference]: Finished difference Result 3982 states and 5507 transitions. [2021-12-28 03:25:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 03:25:20,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 89 [2021-12-28 03:25:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:20,251 INFO L225 Difference]: With dead ends: 3982 [2021-12-28 03:25:20,252 INFO L226 Difference]: Without dead ends: 3979 [2021-12-28 03:25:20,254 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:25:20,255 INFO L933 BasicCegarLoop]: 1005 mSDtfsCounter, 2068 mSDsluCounter, 1900 mSDsCounter, 0 mSdLazyCounter, 1921 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 2905 SdHoareTripleChecker+Invalid, 2831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 1921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:20,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2197 Valid, 2905 Invalid, 2831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 1921 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-28 03:25:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2021-12-28 03:25:20,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3879. [2021-12-28 03:25:20,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3879 states, 2797 states have (on average 1.2609939220593493) internal successors, (3527), 2814 states have internal predecessors, (3527), 838 states have call successors, (838), 215 states have call predecessors, (838), 243 states have return successors, (1014), 869 states have call predecessors, (1014), 834 states have call successors, (1014) [2021-12-28 03:25:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 5379 transitions. [2021-12-28 03:25:20,466 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 5379 transitions. Word has length 89 [2021-12-28 03:25:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:20,467 INFO L470 AbstractCegarLoop]: Abstraction has 3879 states and 5379 transitions. [2021-12-28 03:25:20,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 6 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2021-12-28 03:25:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 5379 transitions. [2021-12-28 03:25:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-12-28 03:25:20,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:20,469 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:20,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 03:25:20,469 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:20,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1748979270, now seen corresponding path program 1 times [2021-12-28 03:25:20,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:20,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694357207] [2021-12-28 03:25:20,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:20,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 03:25:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 03:25:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 03:25:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:25:20,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:20,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694357207] [2021-12-28 03:25:20,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694357207] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:25:20,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14730085] [2021-12-28 03:25:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:20,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:25:20,738 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) [2021-12-28 03:25:20,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 03:25:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:21,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-28 03:25:21,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:25:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:25:21,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:25:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:25:21,768 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14730085] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:25:21,768 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:25:21,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 26 [2021-12-28 03:25:21,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391296579] [2021-12-28 03:25:21,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:25:21,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-28 03:25:21,770 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:21,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-28 03:25:21,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2021-12-28 03:25:21,770 INFO L87 Difference]: Start difference. First operand 3879 states and 5379 transitions. Second operand has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) [2021-12-28 03:25:26,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:26,496 INFO L93 Difference]: Finished difference Result 11133 states and 16255 transitions. [2021-12-28 03:25:26,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-28 03:25:26,497 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) Word has length 94 [2021-12-28 03:25:26,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:26,517 INFO L225 Difference]: With dead ends: 11133 [2021-12-28 03:25:26,517 INFO L226 Difference]: Without dead ends: 7266 [2021-12-28 03:25:26,531 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=177, Invalid=1715, Unknown=0, NotChecked=0, Total=1892 [2021-12-28 03:25:26,533 INFO L933 BasicCegarLoop]: 933 mSDtfsCounter, 1009 mSDsluCounter, 12833 mSDsCounter, 0 mSdLazyCounter, 7657 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 13766 SdHoareTripleChecker+Invalid, 8225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 7657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:26,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1072 Valid, 13766 Invalid, 8225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 7657 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2021-12-28 03:25:26,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7266 states. [2021-12-28 03:25:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7266 to 3833. [2021-12-28 03:25:26,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3833 states, 2762 states have (on average 1.2617668356263576) internal successors, (3485), 2796 states have internal predecessors, (3485), 834 states have call successors, (834), 215 states have call predecessors, (834), 236 states have return successors, (952), 835 states have call predecessors, (952), 828 states have call successors, (952) [2021-12-28 03:25:26,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3833 states to 3833 states and 5271 transitions. [2021-12-28 03:25:26,764 INFO L78 Accepts]: Start accepts. Automaton has 3833 states and 5271 transitions. Word has length 94 [2021-12-28 03:25:26,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:26,764 INFO L470 AbstractCegarLoop]: Abstraction has 3833 states and 5271 transitions. [2021-12-28 03:25:26,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.769230769230769) internal successors, (98), 16 states have internal predecessors, (98), 5 states have call successors, (19), 6 states have call predecessors, (19), 9 states have return successors, (19), 10 states have call predecessors, (19), 5 states have call successors, (19) [2021-12-28 03:25:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3833 states and 5271 transitions. [2021-12-28 03:25:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-12-28 03:25:26,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:26,766 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:26,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 03:25:26,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-28 03:25:26,980 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:26,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:26,980 INFO L85 PathProgramCache]: Analyzing trace with hash -448437055, now seen corresponding path program 1 times [2021-12-28 03:25:26,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:26,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776535007] [2021-12-28 03:25:26,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:26,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:27,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 03:25:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 03:25:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-28 03:25:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:27,206 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 03:25:27,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:27,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776535007] [2021-12-28 03:25:27,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776535007] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:27,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:27,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-28 03:25:27,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967063389] [2021-12-28 03:25:27,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:27,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-28 03:25:27,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:27,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-28 03:25:27,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-12-28 03:25:27,208 INFO L87 Difference]: Start difference. First operand 3833 states and 5271 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-28 03:25:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:29,759 INFO L93 Difference]: Finished difference Result 10144 states and 13936 transitions. [2021-12-28 03:25:29,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-28 03:25:29,759 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 96 [2021-12-28 03:25:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:29,776 INFO L225 Difference]: With dead ends: 10144 [2021-12-28 03:25:29,777 INFO L226 Difference]: Without dead ends: 8384 [2021-12-28 03:25:29,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2021-12-28 03:25:29,782 INFO L933 BasicCegarLoop]: 908 mSDtfsCounter, 1940 mSDsluCounter, 2852 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 886 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2055 SdHoareTripleChecker+Valid, 3760 SdHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 886 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:29,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2055 Valid, 3760 Invalid, 3453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [886 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-28 03:25:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8384 states. [2021-12-28 03:25:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8384 to 8132. [2021-12-28 03:25:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8132 states, 5885 states have (on average 1.2677994902293968) internal successors, (7461), 5936 states have internal predecessors, (7461), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1758 states have call predecessors, (1983), 1731 states have call successors, (1983) [2021-12-28 03:25:30,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8132 states to 8132 states and 11181 transitions. [2021-12-28 03:25:30,151 INFO L78 Accepts]: Start accepts. Automaton has 8132 states and 11181 transitions. Word has length 96 [2021-12-28 03:25:30,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:30,151 INFO L470 AbstractCegarLoop]: Abstraction has 8132 states and 11181 transitions. [2021-12-28 03:25:30,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 9 states have internal predecessors, (67), 6 states have call successors, (11), 6 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2021-12-28 03:25:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 8132 states and 11181 transitions. [2021-12-28 03:25:30,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2021-12-28 03:25:30,153 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:30,153 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:30,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 03:25:30,153 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:30,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 832679025, now seen corresponding path program 1 times [2021-12-28 03:25:30,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:30,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606138067] [2021-12-28 03:25:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:30,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 03:25:30,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 03:25:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2021-12-28 03:25:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:25:30,348 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:30,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606138067] [2021-12-28 03:25:30,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606138067] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:30,348 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:30,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-28 03:25:30,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025365735] [2021-12-28 03:25:30,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:30,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-28 03:25:30,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:30,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-28 03:25:30,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2021-12-28 03:25:30,349 INFO L87 Difference]: Start difference. First operand 8132 states and 11181 transitions. Second operand has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:25:32,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:32,596 INFO L93 Difference]: Finished difference Result 17611 states and 24834 transitions. [2021-12-28 03:25:32,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-28 03:25:32,597 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2021-12-28 03:25:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:32,630 INFO L225 Difference]: With dead ends: 17611 [2021-12-28 03:25:32,630 INFO L226 Difference]: Without dead ends: 10847 [2021-12-28 03:25:32,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2021-12-28 03:25:32,647 INFO L933 BasicCegarLoop]: 810 mSDtfsCounter, 462 mSDsluCounter, 5665 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 6475 SdHoareTripleChecker+Invalid, 3293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:32,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [541 Valid, 6475 Invalid, 3293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3086 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-28 03:25:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10847 states. [2021-12-28 03:25:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10847 to 8126. [2021-12-28 03:25:33,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8126 states, 5879 states have (on average 1.2639904745705053) internal successors, (7431), 5933 states have internal predecessors, (7431), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1755 states have call predecessors, (1983), 1731 states have call successors, (1983) [2021-12-28 03:25:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8126 states to 8126 states and 11151 transitions. [2021-12-28 03:25:33,153 INFO L78 Accepts]: Start accepts. Automaton has 8126 states and 11151 transitions. Word has length 97 [2021-12-28 03:25:33,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:33,154 INFO L470 AbstractCegarLoop]: Abstraction has 8126 states and 11151 transitions. [2021-12-28 03:25:33,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.214285714285714) internal successors, (73), 7 states have internal predecessors, (73), 3 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (11), 5 states have call predecessors, (11), 3 states have call successors, (11) [2021-12-28 03:25:33,154 INFO L276 IsEmpty]: Start isEmpty. Operand 8126 states and 11151 transitions. [2021-12-28 03:25:33,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2021-12-28 03:25:33,156 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:33,156 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:33,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 03:25:33,156 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:33,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1118058599, now seen corresponding path program 1 times [2021-12-28 03:25:33,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:33,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965026436] [2021-12-28 03:25:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:33,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:25:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 03:25:33,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 03:25:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-28 03:25:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2021-12-28 03:25:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-28 03:25:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2021-12-28 03:25:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2021-12-28 03:25:33,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-28 03:25:33,350 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:33,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965026436] [2021-12-28 03:25:33,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965026436] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:25:33,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705928515] [2021-12-28 03:25:33,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:33,351 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:33,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:25:33,372 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:25:33,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 03:25:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:33,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 1551 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 03:25:33,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:25:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-28 03:25:33,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-28 03:25:33,980 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705928515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:33,980 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-28 03:25:33,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2021-12-28 03:25:33,983 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739635277] [2021-12-28 03:25:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:33,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:25:33,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:33,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:25:33,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:25:33,984 INFO L87 Difference]: Start difference. First operand 8126 states and 11151 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-28 03:25:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:34,360 INFO L93 Difference]: Finished difference Result 16288 states and 22354 transitions. [2021-12-28 03:25:34,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:25:34,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2021-12-28 03:25:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:34,383 INFO L225 Difference]: With dead ends: 16288 [2021-12-28 03:25:34,384 INFO L226 Difference]: Without dead ends: 8174 [2021-12-28 03:25:34,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:25:34,400 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 1 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:34,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 1083 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 03:25:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8174 states. [2021-12-28 03:25:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8174 to 8158. [2021-12-28 03:25:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8158 states, 5911 states have (on average 1.2625613263407207) internal successors, (7463), 5965 states have internal predecessors, (7463), 1737 states have call successors, (1737), 461 states have call predecessors, (1737), 509 states have return successors, (1983), 1755 states have call predecessors, (1983), 1731 states have call successors, (1983) [2021-12-28 03:25:34,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8158 states to 8158 states and 11183 transitions. [2021-12-28 03:25:34,852 INFO L78 Accepts]: Start accepts. Automaton has 8158 states and 11183 transitions. Word has length 108 [2021-12-28 03:25:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:34,855 INFO L470 AbstractCegarLoop]: Abstraction has 8158 states and 11183 transitions. [2021-12-28 03:25:34,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2021-12-28 03:25:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 8158 states and 11183 transitions. [2021-12-28 03:25:34,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-12-28 03:25:34,858 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:34,859 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:34,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-28 03:25:35,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-28 03:25:35,082 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:35,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:35,082 INFO L85 PathProgramCache]: Analyzing trace with hash 920282283, now seen corresponding path program 1 times [2021-12-28 03:25:35,082 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:35,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116232336] [2021-12-28 03:25:35,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:35,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-28 03:25:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 03:25:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 03:25:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 03:25:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2021-12-28 03:25:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:35,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:35,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-28 03:25:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2021-12-28 03:25:35,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 03:25:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-28 03:25:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-12-28 03:25:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2021-12-28 03:25:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-28 03:25:35,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:35,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116232336] [2021-12-28 03:25:35,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116232336] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:35,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:35,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-28 03:25:35,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964081149] [2021-12-28 03:25:35,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:35,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:25:35,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:35,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:25:35,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-12-28 03:25:35,300 INFO L87 Difference]: Start difference. First operand 8158 states and 11183 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-12-28 03:25:42,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-28 03:25:42,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:42,447 INFO L93 Difference]: Finished difference Result 18980 states and 26789 transitions. [2021-12-28 03:25:42,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 03:25:42,448 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 120 [2021-12-28 03:25:42,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:42,491 INFO L225 Difference]: With dead ends: 18980 [2021-12-28 03:25:42,491 INFO L226 Difference]: Without dead ends: 12202 [2021-12-28 03:25:42,527 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-12-28 03:25:42,529 INFO L933 BasicCegarLoop]: 790 mSDtfsCounter, 505 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 321 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 574 SdHoareTripleChecker+Valid, 3693 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 321 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:42,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [574 Valid, 3693 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [321 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2021-12-28 03:25:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12202 states. [2021-12-28 03:25:43,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12202 to 7987. [2021-12-28 03:25:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7987 states, 5818 states have (on average 1.2619456858026814) internal successors, (7342), 5860 states have internal predecessors, (7342), 1675 states have call successors, (1675), 445 states have call predecessors, (1675), 493 states have return successors, (1921), 1705 states have call predecessors, (1921), 1669 states have call successors, (1921) [2021-12-28 03:25:43,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7987 states to 7987 states and 10938 transitions. [2021-12-28 03:25:43,109 INFO L78 Accepts]: Start accepts. Automaton has 7987 states and 10938 transitions. Word has length 120 [2021-12-28 03:25:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:43,110 INFO L470 AbstractCegarLoop]: Abstraction has 7987 states and 10938 transitions. [2021-12-28 03:25:43,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (17), 7 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2021-12-28 03:25:43,110 INFO L276 IsEmpty]: Start isEmpty. Operand 7987 states and 10938 transitions. [2021-12-28 03:25:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-28 03:25:43,116 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:43,116 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:43,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-28 03:25:43,116 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:43,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:43,117 INFO L85 PathProgramCache]: Analyzing trace with hash -2053204873, now seen corresponding path program 1 times [2021-12-28 03:25:43,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:43,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726198742] [2021-12-28 03:25:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:43,118 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:43,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-28 03:25:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-28 03:25:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2021-12-28 03:25:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2021-12-28 03:25:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 03:25:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:25:43,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:43,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726198742] [2021-12-28 03:25:43,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726198742] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:25:43,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:25:43,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-12-28 03:25:43,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750584108] [2021-12-28 03:25:43,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:25:43,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-28 03:25:43,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:43,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-28 03:25:43,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2021-12-28 03:25:43,420 INFO L87 Difference]: Start difference. First operand 7987 states and 10938 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-28 03:25:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 03:25:46,039 INFO L93 Difference]: Finished difference Result 15028 states and 21199 transitions. [2021-12-28 03:25:46,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-28 03:25:46,040 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) Word has length 104 [2021-12-28 03:25:46,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 03:25:46,067 INFO L225 Difference]: With dead ends: 15028 [2021-12-28 03:25:46,068 INFO L226 Difference]: Without dead ends: 10127 [2021-12-28 03:25:46,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2021-12-28 03:25:46,086 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 559 mSDsluCounter, 5390 mSDsCounter, 0 mSdLazyCounter, 2894 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 6188 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 2894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2021-12-28 03:25:46,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 6188 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 2894 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 03:25:46,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10127 states. [2021-12-28 03:25:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10127 to 7133. [2021-12-28 03:25:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7133 states, 5203 states have (on average 1.2588891024408995) internal successors, (6550), 5251 states have internal predecessors, (6550), 1490 states have call successors, (1490), 403 states have call predecessors, (1490), 439 states have return successors, (1669), 1502 states have call predecessors, (1669), 1484 states have call successors, (1669) [2021-12-28 03:25:46,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7133 states to 7133 states and 9709 transitions. [2021-12-28 03:25:46,517 INFO L78 Accepts]: Start accepts. Automaton has 7133 states and 9709 transitions. Word has length 104 [2021-12-28 03:25:46,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 03:25:46,519 INFO L470 AbstractCegarLoop]: Abstraction has 7133 states and 9709 transitions. [2021-12-28 03:25:46,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (11), 6 states have call predecessors, (11), 4 states have call successors, (11) [2021-12-28 03:25:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 7133 states and 9709 transitions. [2021-12-28 03:25:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-12-28 03:25:46,521 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 03:25:46,522 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:25:46,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-28 03:25:46,522 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 03:25:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:25:46,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1247847667, now seen corresponding path program 1 times [2021-12-28 03:25:46,522 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:25:46,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059483367] [2021-12-28 03:25:46,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:46,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:25:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 03:25:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-12-28 03:25:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 03:25:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-28 03:25:46,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-28 03:25:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-28 03:25:46,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 03:25:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 03:25:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-28 03:25:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 03:25:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 03:25:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-28 03:25:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-28 03:25:46,699 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:25:46,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059483367] [2021-12-28 03:25:46,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059483367] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:25:46,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950013177] [2021-12-28 03:25:46,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:25:46,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:25:46,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:25:46,701 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:25:46,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 03:25:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:25:47,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-28 03:25:47,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:25:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-28 03:25:47,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:25:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-28 03:25:47,505 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950013177] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:25:47,505 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:25:47,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 13 [2021-12-28 03:25:47,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984649493] [2021-12-28 03:25:47,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:25:47,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 03:25:47,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:25:47,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 03:25:47,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2021-12-28 03:25:47,507 INFO L87 Difference]: Start difference. First operand 7133 states and 9709 transitions. Second operand has 13 states, 13 states have (on average 8.538461538461538) internal successors, (111), 9 states have internal predecessors, (111), 3 states have call successors, (27), 5 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)