./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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-media-dvb-ttusb-dec-ttusb_dec.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 2c6aa6e54aa03d80dc4005d195dc80cde5e772aed59b94df03248a4abb3fc0ec --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:21:13,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:21:13,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:21:13,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:21:13,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:21:13,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:21:13,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:21:13,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:21:13,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:21:13,479 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:21:13,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:21:13,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:21:13,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:21:13,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:21:13,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:21:13,487 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:21:13,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:21:13,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:21:13,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:21:13,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:21:13,498 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:21:13,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:21:13,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:21:13,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:21:13,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:21:13,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:21:13,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:21:13,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:21:13,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:21:13,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:21:13,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:21:13,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:21:13,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:21:13,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:21:13,516 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:21:13,517 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:21:13,517 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:21:13,518 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:21:13,518 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:21:13,519 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:21:13,520 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:21:13,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:21:13,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:21:13,555 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:21:13,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:21:13,556 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:21:13,556 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:21:13,557 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:21:13,557 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:21:13,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:21:13,558 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:21:13,558 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:21:13,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:21:13,559 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:21:13,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:21:13,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:21:13,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:21:13,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:21:13,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:21:13,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:21:13,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:21:13,561 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:21:13,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:21:13,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:21:13,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:21:13,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:21:13,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:21:13,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:21:13,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:21:13,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:21:13,563 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:21:13,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:21:13,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:21:13,564 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 -> 2c6aa6e54aa03d80dc4005d195dc80cde5e772aed59b94df03248a4abb3fc0ec [2022-07-12 11:21:13,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:21:13,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:21:13,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:21:13,795 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:21:13,795 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:21:13,796 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-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2022-07-12 11:21:13,857 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3fd6af/3dd78aedd0114d329cf39ad3fd01b2ff/FLAGcaabde7e8 [2022-07-12 11:21:14,618 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:21:14,619 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2022-07-12 11:21:14,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3fd6af/3dd78aedd0114d329cf39ad3fd01b2ff/FLAGcaabde7e8 [2022-07-12 11:21:14,853 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8a3fd6af/3dd78aedd0114d329cf39ad3fd01b2ff [2022-07-12 11:21:14,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:21:14,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:21:14,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:21:14,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:21:14,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:21:14,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:21:14" (1/1) ... [2022-07-12 11:21:14,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ebc486a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:14, skipping insertion in model container [2022-07-12 11:21:14,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:21:14" (1/1) ... [2022-07-12 11:21:14,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:21:14,990 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:21:16,547 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-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i[284671,284684] [2022-07-12 11:21:16,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:21:16,638 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:21:16,962 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-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i[284671,284684] [2022-07-12 11:21:16,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:21:17,032 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:21:17,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17 WrapperNode [2022-07-12 11:21:17,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:21:17,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:21:17,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:21:17,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:21:17,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,246 INFO L137 Inliner]: procedures = 177, calls = 1597, calls flagged for inlining = 87, calls inlined = 82, statements flattened = 3772 [2022-07-12 11:21:17,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:21:17,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:21:17,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:21:17,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:21:17,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:21:17,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:21:17,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:21:17,474 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:21:17,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (1/1) ... [2022-07-12 11:21:17,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:21:17,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:21:17,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 11:21:17,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 11:21:17,542 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2022-07-12 11:21:17,542 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2022-07-12 11:21:17,543 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-12 11:21:17,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-12 11:21:17,543 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-12 11:21:17,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-12 11:21:17,543 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2022-07-12 11:21:17,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2022-07-12 11:21:17,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 11:21:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-12 11:21:17,544 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-12 11:21:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-07-12 11:21:17,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2022-07-12 11:21:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 11:21:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 11:21:17,544 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-12 11:21:17,545 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-12 11:21:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:21:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_dvb [2022-07-12 11:21:17,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_dvb [2022-07-12 11:21:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-07-12 11:21:17,545 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-07-12 11:21:17,545 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2022-07-12 11:21:17,546 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2022-07-12 11:21:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 11:21:17,546 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 11:21:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 11:21:17,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 11:21:17,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 11:21:17,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 11:21:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 11:21:17,547 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 11:21:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible_nested [2022-07-12 11:21:17,547 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible_nested [2022-07-12 11:21:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 11:21:17,547 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 11:21:17,547 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2022-07-12 11:21:17,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2022-07-12 11:21:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-12 11:21:17,548 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-12 11:21:17,548 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2022-07-12 11:21:17,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2022-07-12 11:21:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:21:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-12 11:21:17,549 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-12 11:21:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2022-07-12 11:21:17,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2022-07-12 11:21:17,549 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2022-07-12 11:21:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2022-07-12 11:21:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-12 11:21:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-12 11:21:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2022-07-12 11:21:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2022-07-12 11:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit [2022-07-12 11:21:17,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit [2022-07-12 11:21:17,551 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2022-07-12 11:21:17,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2022-07-12 11:21:17,552 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2022-07-12 11:21:17,552 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2022-07-12 11:21:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:21:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-12 11:21:17,553 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-12 11:21:17,553 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init [2022-07-12 11:21:17,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init [2022-07-12 11:21:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:21:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:21:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:21:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2022-07-12 11:21:17,554 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2022-07-12 11:21:17,554 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-12 11:21:17,554 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-12 11:21:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 11:21:17,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 11:21:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:21:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-12 11:21:17,555 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-12 11:21:17,555 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-12 11:21:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-12 11:21:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-12 11:21:17,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-12 11:21:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:21:17,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:21:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_probe [2022-07-12 11:21:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_probe [2022-07-12 11:21:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-07-12 11:21:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-07-12 11:21:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2022-07-12 11:21:17,557 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2022-07-12 11:21:17,557 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-07-12 11:21:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-07-12 11:21:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 11:21:17,558 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 11:21:17,558 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-12 11:21:17,559 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-12 11:21:17,559 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-12 11:21:17,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-12 11:21:17,559 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_dvb [2022-07-12 11:21:17,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_dvb [2022-07-12 11:21:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-12 11:21:17,560 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-12 11:21:17,560 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 11:21:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 11:21:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_disconnect [2022-07-12 11:21:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_disconnect [2022-07-12 11:21:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-12 11:21:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-12 11:21:17,561 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-12 11:21:17,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-12 11:21:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2022-07-12 11:21:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2022-07-12 11:21:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-07-12 11:21:17,562 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-07-12 11:21:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:21:17,562 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2022-07-12 11:21:17,563 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2022-07-12 11:21:17,563 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2022-07-12 11:21:17,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2022-07-12 11:21:17,564 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-12 11:21:17,564 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-12 11:21:17,566 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2022-07-12 11:21:17,566 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2022-07-12 11:21:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 11:21:17,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:21:17,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:21:18,120 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:21:18,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:21:18,300 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:21:18,383 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-07-12 11:21:18,383 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-07-12 11:21:18,608 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:21:19,503 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##239: assume false; [2022-07-12 11:21:19,503 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##240: assume !false; [2022-07-12 11:21:19,735 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-12 11:21:19,746 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:21:19,747 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:21:22,138 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##78: assume !false; [2022-07-12 11:21:22,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##77: assume false; [2022-07-12 11:21:22,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2022-07-12 11:21:22,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2022-07-12 11:21:22,139 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L8653: ttusb_dec_start_feed_#res#1 := 0; [2022-07-12 11:21:22,443 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-12 11:21:23,108 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-12 11:21:23,108 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-12 11:21:23,149 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:21:23,168 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:21:23,168 INFO L299 CfgBuilder]: Removed 38 assume(true) statements. [2022-07-12 11:21:23,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:21:23 BoogieIcfgContainer [2022-07-12 11:21:23,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:21:23,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:21:23,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:21:23,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:21:23,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:21:14" (1/3) ... [2022-07-12 11:21:23,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fb91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:21:23, skipping insertion in model container [2022-07-12 11:21:23,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:21:17" (2/3) ... [2022-07-12 11:21:23,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@255fb91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:21:23, skipping insertion in model container [2022-07-12 11:21:23,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:21:23" (3/3) ... [2022-07-12 11:21:23,180 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-media-dvb-ttusb-dec-ttusb_dec.ko.cil.out.i [2022-07-12 11:21:23,192 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:21:23,193 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:21:23,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:21:23,288 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@fca366e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@77722cb3 [2022-07-12 11:21:23,289 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:21:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand has 1017 states, 763 states have (on average 1.4233289646133682) internal successors, (1086), 787 states have internal predecessors, (1086), 199 states have call successors, (199), 54 states have call predecessors, (199), 53 states have return successors, (197), 191 states have call predecessors, (197), 197 states have call successors, (197) [2022-07-12 11:21:23,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 11:21:23,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:23,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:23,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:23,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1801714647, now seen corresponding path program 1 times [2022-07-12 11:21:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:23,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357175009] [2022-07-12 11:21:23,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:23,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:23,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357175009] [2022-07-12 11:21:23,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357175009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:23,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:23,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:21:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186325246] [2022-07-12 11:21:23,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:23,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:21:23,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:24,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:21:24,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:21:24,008 INFO L87 Difference]: Start difference. First operand has 1017 states, 763 states have (on average 1.4233289646133682) internal successors, (1086), 787 states have internal predecessors, (1086), 199 states have call successors, (199), 54 states have call predecessors, (199), 53 states have return successors, (197), 191 states have call predecessors, (197), 197 states have call successors, (197) 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) [2022-07-12 11:21:24,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:24,260 INFO L93 Difference]: Finished difference Result 3011 states and 4514 transitions. [2022-07-12 11:21:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:21:24,263 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 [2022-07-12 11:21:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:24,301 INFO L225 Difference]: With dead ends: 3011 [2022-07-12 11:21:24,302 INFO L226 Difference]: Without dead ends: 1992 [2022-07-12 11:21:24,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:21:24,320 INFO L413 NwaCegarLoop]: 1995 mSDtfsCounter, 1373 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3368 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 [2022-07-12 11:21:24,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3368 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:21:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2022-07-12 11:21:24,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1988. [2022-07-12 11:21:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1495 states have (on average 1.3036789297658864) internal successors, (1949), 1523 states have internal predecessors, (1949), 389 states have call successors, (389), 104 states have call predecessors, (389), 103 states have return successors, (399), 373 states have call predecessors, (399), 385 states have call successors, (399) [2022-07-12 11:21:24,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2737 transitions. [2022-07-12 11:21:24,507 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2737 transitions. Word has length 16 [2022-07-12 11:21:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:24,508 INFO L495 AbstractCegarLoop]: Abstraction has 1988 states and 2737 transitions. [2022-07-12 11:21:24,508 INFO L496 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) [2022-07-12 11:21:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2737 transitions. [2022-07-12 11:21:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 11:21:24,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:24,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:24,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:21:24,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -18956933, now seen corresponding path program 1 times [2022-07-12 11:21:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:24,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562619228] [2022-07-12 11:21:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:24,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:24,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:24,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562619228] [2022-07-12 11:21:24,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562619228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:24,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:24,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 11:21:24,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146292309] [2022-07-12 11:21:24,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:24,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:21:24,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:24,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:21:24,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:21:24,793 INFO L87 Difference]: Start difference. First operand 1988 states and 2737 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) [2022-07-12 11:21:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:24,988 INFO L93 Difference]: Finished difference Result 5937 states and 8252 transitions. [2022-07-12 11:21:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:21:24,989 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 [2022-07-12 11:21:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:25,019 INFO L225 Difference]: With dead ends: 5937 [2022-07-12 11:21:25,019 INFO L226 Difference]: Without dead ends: 3953 [2022-07-12 11:21:25,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:21:25,032 INFO L413 NwaCegarLoop]: 1814 mSDtfsCounter, 1360 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 3180 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 [2022-07-12 11:21:25,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 3180 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:21:25,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3953 states. [2022-07-12 11:21:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3953 to 3946. [2022-07-12 11:21:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3946 states, 2969 states have (on average 1.3031323678006064) internal successors, (3869), 3020 states have internal predecessors, (3869), 772 states have call successors, (772), 205 states have call predecessors, (772), 204 states have return successors, (832), 744 states have call predecessors, (832), 768 states have call successors, (832) [2022-07-12 11:21:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3946 states to 3946 states and 5473 transitions. [2022-07-12 11:21:25,201 INFO L78 Accepts]: Start accepts. Automaton has 3946 states and 5473 transitions. Word has length 17 [2022-07-12 11:21:25,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:25,202 INFO L495 AbstractCegarLoop]: Abstraction has 3946 states and 5473 transitions. [2022-07-12 11:21:25,202 INFO L496 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) [2022-07-12 11:21:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 3946 states and 5473 transitions. [2022-07-12 11:21:25,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 11:21:25,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:25,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:25,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:21:25,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:25,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1768602684, now seen corresponding path program 1 times [2022-07-12 11:21:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:25,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144251037] [2022-07-12 11:21:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:25,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:25,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:21:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:21:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:25,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:25,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144251037] [2022-07-12 11:21:25,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144251037] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:25,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:25,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:21:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905065355] [2022-07-12 11:21:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:25,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:21:25,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:25,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:21:25,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:21:25,543 INFO L87 Difference]: Start difference. First operand 3946 states and 5473 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:21:27,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:31,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:31,546 INFO L93 Difference]: Finished difference Result 8818 states and 12470 transitions. [2022-07-12 11:21:31,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:21:31,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-12 11:21:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:31,582 INFO L225 Difference]: With dead ends: 8818 [2022-07-12 11:21:31,583 INFO L226 Difference]: Without dead ends: 4880 [2022-07-12 11:21:31,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:21:31,607 INFO L413 NwaCegarLoop]: 1471 mSDtfsCounter, 544 mSDsluCounter, 4036 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 246 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 5507 SdHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:31,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 5507 Invalid, 1820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1573 Invalid, 1 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 11:21:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2022-07-12 11:21:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4051. [2022-07-12 11:21:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4051 states, 3044 states have (on average 1.2992772667542707) internal successors, (3955), 3101 states have internal predecessors, (3955), 793 states have call successors, (793), 205 states have call predecessors, (793), 213 states have return successors, (892), 768 states have call predecessors, (892), 789 states have call successors, (892) [2022-07-12 11:21:31,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4051 states to 4051 states and 5640 transitions. [2022-07-12 11:21:31,829 INFO L78 Accepts]: Start accepts. Automaton has 4051 states and 5640 transitions. Word has length 60 [2022-07-12 11:21:31,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:31,830 INFO L495 AbstractCegarLoop]: Abstraction has 4051 states and 5640 transitions. [2022-07-12 11:21:31,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:21:31,830 INFO L276 IsEmpty]: Start isEmpty. Operand 4051 states and 5640 transitions. [2022-07-12 11:21:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-12 11:21:31,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:31,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:21:31,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:21:31,833 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:31,833 INFO L85 PathProgramCache]: Analyzing trace with hash -156930627, now seen corresponding path program 1 times [2022-07-12 11:21:31,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:31,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075119552] [2022-07-12 11:21:31,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:31,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:32,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:32,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 11:21:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:32,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:21:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:32,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:21:32,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:32,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075119552] [2022-07-12 11:21:32,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075119552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:32,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:32,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 11:21:32,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401826321] [2022-07-12 11:21:32,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:32,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:21:32,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:32,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:21:32,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:21:32,096 INFO L87 Difference]: Start difference. First operand 4051 states and 5640 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:21:34,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:36,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:36,583 INFO L93 Difference]: Finished difference Result 8955 states and 12692 transitions. [2022-07-12 11:21:36,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:21:36,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-07-12 11:21:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:36,624 INFO L225 Difference]: With dead ends: 8955 [2022-07-12 11:21:36,624 INFO L226 Difference]: Without dead ends: 4915 [2022-07-12 11:21:36,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 11:21:36,652 INFO L413 NwaCegarLoop]: 1484 mSDtfsCounter, 554 mSDsluCounter, 1771 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 247 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 3255 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:36,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 3255 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 730 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-07-12 11:21:36,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4915 states. [2022-07-12 11:21:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4915 to 4086. [2022-07-12 11:21:36,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4086 states, 3079 states have (on average 1.299447872685937) internal successors, (4001), 3136 states have internal predecessors, (4001), 793 states have call successors, (793), 205 states have call predecessors, (793), 213 states have return successors, (892), 768 states have call predecessors, (892), 789 states have call successors, (892) [2022-07-12 11:21:36,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4086 states to 4086 states and 5686 transitions. [2022-07-12 11:21:36,879 INFO L78 Accepts]: Start accepts. Automaton has 4086 states and 5686 transitions. Word has length 60 [2022-07-12 11:21:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:36,879 INFO L495 AbstractCegarLoop]: Abstraction has 4086 states and 5686 transitions. [2022-07-12 11:21:36,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:21:36,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4086 states and 5686 transitions. [2022-07-12 11:21:36,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:21:36,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:36,885 INFO L195 NwaCegarLoop]: 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] [2022-07-12 11:21:36,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:21:36,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:36,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1752503899, now seen corresponding path program 1 times [2022-07-12 11:21:36,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:36,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825378813] [2022-07-12 11:21:36,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:36,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:37,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:21:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:37,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:21:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:37,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:37,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:21:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:37,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:21:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:37,280 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 11:21:37,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:37,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825378813] [2022-07-12 11:21:37,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825378813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:37,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:37,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:21:37,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203257926] [2022-07-12 11:21:37,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:37,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:21:37,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:37,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:21:37,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:21:37,283 INFO L87 Difference]: Start difference. First operand 4086 states and 5686 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-12 11:21:40,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:49,566 INFO L93 Difference]: Finished difference Result 14421 states and 21784 transitions. [2022-07-12 11:21:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:21:49,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 94 [2022-07-12 11:21:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:49,639 INFO L225 Difference]: With dead ends: 14421 [2022-07-12 11:21:49,639 INFO L226 Difference]: Without dead ends: 10347 [2022-07-12 11:21:49,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:21:49,674 INFO L413 NwaCegarLoop]: 2094 mSDtfsCounter, 2798 mSDsluCounter, 4444 mSDsCounter, 0 mSdLazyCounter, 4859 mSolverCounterSat, 1182 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3008 SdHoareTripleChecker+Valid, 6538 SdHoareTripleChecker+Invalid, 6042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1182 IncrementalHoareTripleChecker+Valid, 4859 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:49,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3008 Valid, 6538 Invalid, 6042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1182 Valid, 4859 Invalid, 1 Unknown, 0 Unchecked, 11.6s Time] [2022-07-12 11:21:49,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10347 states. [2022-07-12 11:21:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10347 to 8345. [2022-07-12 11:21:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8345 states, 6262 states have (on average 1.2986266368572341) internal successors, (8132), 6459 states have internal predecessors, (8132), 1580 states have call successors, (1580), 393 states have call predecessors, (1580), 502 states have return successors, (2508), 1552 states have call predecessors, (2508), 1576 states have call successors, (2508) [2022-07-12 11:21:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8345 states to 8345 states and 12220 transitions. [2022-07-12 11:21:50,210 INFO L78 Accepts]: Start accepts. Automaton has 8345 states and 12220 transitions. Word has length 94 [2022-07-12 11:21:50,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:21:50,212 INFO L495 AbstractCegarLoop]: Abstraction has 8345 states and 12220 transitions. [2022-07-12 11:21:50,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 4 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-07-12 11:21:50,213 INFO L276 IsEmpty]: Start isEmpty. Operand 8345 states and 12220 transitions. [2022-07-12 11:21:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 11:21:50,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:21:50,287 INFO L195 NwaCegarLoop]: 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] [2022-07-12 11:21:50,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:21:50,287 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:21:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:21:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash -865281053, now seen corresponding path program 1 times [2022-07-12 11:21:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:21:50,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354562638] [2022-07-12 11:21:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:21:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:21:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:50,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:21:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:21:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:50,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:21:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:50,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:50,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:50,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:21:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:50,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:21:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:50,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:21:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:21:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 11:21:50,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:21:50,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354562638] [2022-07-12 11:21:50,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354562638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:21:50,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:21:50,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:21:50,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744292229] [2022-07-12 11:21:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:21:50,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:21:50,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:21:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:21:50,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:21:50,699 INFO L87 Difference]: Start difference. First operand 8345 states and 12220 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 11:21:53,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:21:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:21:59,454 INFO L93 Difference]: Finished difference Result 19289 states and 29154 transitions. [2022-07-12 11:21:59,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:21:59,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 94 [2022-07-12 11:21:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:21:59,506 INFO L225 Difference]: With dead ends: 19289 [2022-07-12 11:21:59,507 INFO L226 Difference]: Without dead ends: 10956 [2022-07-12 11:21:59,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:21:59,541 INFO L413 NwaCegarLoop]: 1364 mSDtfsCounter, 2534 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 1296 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2619 SdHoareTripleChecker+Valid, 4382 SdHoareTripleChecker+Invalid, 3807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1296 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:21:59,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2619 Valid, 4382 Invalid, 3807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1296 Valid, 2510 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2022-07-12 11:21:59,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10956 states. [2022-07-12 11:22:00,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10956 to 8724. [2022-07-12 11:22:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8724 states, 6534 states have (on average 1.2976737067646158) internal successors, (8479), 6741 states have internal predecessors, (8479), 1649 states have call successors, (1649), 419 states have call predecessors, (1649), 540 states have return successors, (2695), 1623 states have call predecessors, (2695), 1645 states have call successors, (2695) [2022-07-12 11:22:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8724 states to 8724 states and 12823 transitions. [2022-07-12 11:22:00,102 INFO L78 Accepts]: Start accepts. Automaton has 8724 states and 12823 transitions. Word has length 94 [2022-07-12 11:22:00,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:00,103 INFO L495 AbstractCegarLoop]: Abstraction has 8724 states and 12823 transitions. [2022-07-12 11:22:00,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 5 states have internal predecessors, (70), 4 states have call successors, (10), 5 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-12 11:22:00,104 INFO L276 IsEmpty]: Start isEmpty. Operand 8724 states and 12823 transitions. [2022-07-12 11:22:00,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-12 11:22:00,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:00,105 INFO L195 NwaCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:00,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:22:00,106 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1105666320, now seen corresponding path program 1 times [2022-07-12 11:22:00,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:00,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855784888] [2022-07-12 11:22:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:00,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:00,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:22:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:22:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 11:22:00,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:00,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855784888] [2022-07-12 11:22:00,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855784888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:00,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:22:00,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:22:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767491615] [2022-07-12 11:22:00,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:00,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:22:00,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:00,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:22:00,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:22:00,422 INFO L87 Difference]: Start difference. First operand 8724 states and 12823 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 11:22:03,072 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:22:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:07,120 INFO L93 Difference]: Finished difference Result 19579 states and 30376 transitions. [2022-07-12 11:22:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:22:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 103 [2022-07-12 11:22:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:07,178 INFO L225 Difference]: With dead ends: 19579 [2022-07-12 11:22:07,179 INFO L226 Difference]: Without dead ends: 10867 [2022-07-12 11:22:07,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:22:07,236 INFO L413 NwaCegarLoop]: 1410 mSDtfsCounter, 625 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1568 mSolverCounterSat, 283 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 3646 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1568 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:07,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 3646 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1568 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 11:22:07,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10867 states. [2022-07-12 11:22:07,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10867 to 8750. [2022-07-12 11:22:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8750 states, 6560 states have (on average 1.2964939024390243) internal successors, (8505), 6767 states have internal predecessors, (8505), 1649 states have call successors, (1649), 419 states have call predecessors, (1649), 540 states have return successors, (2695), 1623 states have call predecessors, (2695), 1645 states have call successors, (2695) [2022-07-12 11:22:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 12849 transitions. [2022-07-12 11:22:07,772 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 12849 transitions. Word has length 103 [2022-07-12 11:22:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:07,772 INFO L495 AbstractCegarLoop]: Abstraction has 8750 states and 12849 transitions. [2022-07-12 11:22:07,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-07-12 11:22:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 12849 transitions. [2022-07-12 11:22:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 11:22:07,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:07,775 INFO L195 NwaCegarLoop]: 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] [2022-07-12 11:22:07,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:22:07,775 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:07,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash 387197066, now seen corresponding path program 1 times [2022-07-12 11:22:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:07,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9916145] [2022-07-12 11:22:07,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:22:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:22:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:22:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 11:22:08,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:08,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9916145] [2022-07-12 11:22:08,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9916145] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:08,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733561782] [2022-07-12 11:22:08,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:08,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:08,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:08,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:08,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 11:22:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:09,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 2804 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 11:22:09,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:09,099 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 11:22:09,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:09,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733561782] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:09,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:09,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2022-07-12 11:22:09,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414808101] [2022-07-12 11:22:09,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:09,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:22:09,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:09,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:22:09,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:09,116 INFO L87 Difference]: Start difference. First operand 8750 states and 12849 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 11:22:09,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:09,622 INFO L93 Difference]: Finished difference Result 17235 states and 25279 transitions. [2022-07-12 11:22:09,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:22:09,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2022-07-12 11:22:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:09,672 INFO L225 Difference]: With dead ends: 17235 [2022-07-12 11:22:09,672 INFO L226 Difference]: Without dead ends: 8486 [2022-07-12 11:22:09,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:22:09,721 INFO L413 NwaCegarLoop]: 1382 mSDtfsCounter, 13 mSDsluCounter, 4124 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5506 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:09,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5506 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:22:09,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8486 states. [2022-07-12 11:22:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8486 to 8438. [2022-07-12 11:22:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8438 states, 6314 states have (on average 1.2944250871080138) internal successors, (8173), 6514 states have internal predecessors, (8173), 1605 states have call successors, (1605), 398 states have call predecessors, (1605), 518 states have return successors, (2578), 1581 states have call predecessors, (2578), 1601 states have call successors, (2578) [2022-07-12 11:22:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8438 states to 8438 states and 12356 transitions. [2022-07-12 11:22:10,199 INFO L78 Accepts]: Start accepts. Automaton has 8438 states and 12356 transitions. Word has length 111 [2022-07-12 11:22:10,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:10,199 INFO L495 AbstractCegarLoop]: Abstraction has 8438 states and 12356 transitions. [2022-07-12 11:22:10,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 11:22:10,200 INFO L276 IsEmpty]: Start isEmpty. Operand 8438 states and 12356 transitions. [2022-07-12 11:22:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 11:22:10,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:10,201 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-07-12 11:22:10,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:10,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:10,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:10,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:10,428 INFO L85 PathProgramCache]: Analyzing trace with hash 623950775, now seen corresponding path program 1 times [2022-07-12 11:22:10,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:10,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101137702] [2022-07-12 11:22:10,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:10,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:10,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:10,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:22:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:22:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:22:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:22:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:11,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:22:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:22:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:22:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 11:22:11,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:11,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101137702] [2022-07-12 11:22:11,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101137702] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:11,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917405557] [2022-07-12 11:22:11,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:11,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:11,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:11,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:11,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 11:22:12,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:12,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 2937 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:22:12,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 11:22:12,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:12,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917405557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:12,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:12,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-07-12 11:22:12,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882424728] [2022-07-12 11:22:12,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:12,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:22:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:12,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:22:12,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:22:12,237 INFO L87 Difference]: Start difference. First operand 8438 states and 12356 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:22:12,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:12,549 INFO L93 Difference]: Finished difference Result 8490 states and 12408 transitions. [2022-07-12 11:22:12,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:22:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 124 [2022-07-12 11:22:12,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:12,589 INFO L225 Difference]: With dead ends: 8490 [2022-07-12 11:22:12,589 INFO L226 Difference]: Without dead ends: 8464 [2022-07-12 11:22:12,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-12 11:22:12,598 INFO L413 NwaCegarLoop]: 1371 mSDtfsCounter, 1368 mSDsluCounter, 2748 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 4119 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:12,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 4119 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:12,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8464 states. [2022-07-12 11:22:12,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8464 to 8438. [2022-07-12 11:22:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8438 states, 6314 states have (on average 1.2939499524865379) internal successors, (8170), 6514 states have internal predecessors, (8170), 1605 states have call successors, (1605), 398 states have call predecessors, (1605), 518 states have return successors, (2578), 1581 states have call predecessors, (2578), 1601 states have call successors, (2578) [2022-07-12 11:22:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8438 states to 8438 states and 12353 transitions. [2022-07-12 11:22:13,055 INFO L78 Accepts]: Start accepts. Automaton has 8438 states and 12353 transitions. Word has length 124 [2022-07-12 11:22:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:13,056 INFO L495 AbstractCegarLoop]: Abstraction has 8438 states and 12353 transitions. [2022-07-12 11:22:13,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:22:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 8438 states and 12353 transitions. [2022-07-12 11:22:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 11:22:13,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:13,058 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:13,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:13,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-12 11:22:13,293 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:13,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:13,293 INFO L85 PathProgramCache]: Analyzing trace with hash -2082115524, now seen corresponding path program 1 times [2022-07-12 11:22:13,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:13,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090491016] [2022-07-12 11:22:13,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:13,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:22:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:22:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:22:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:22:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:22:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:22:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:22:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:22:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:22:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 11:22:13,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:13,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090491016] [2022-07-12 11:22:13,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090491016] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:13,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163261563] [2022-07-12 11:22:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:13,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:13,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:13,949 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) [2022-07-12 11:22:13,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 11:22:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:14,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 3014 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 11:22:14,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:15,024 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 11:22:15,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:15,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163261563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:15,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:15,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-12 11:22:15,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212373961] [2022-07-12 11:22:15,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:15,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:22:15,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:15,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:22:15,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:15,027 INFO L87 Difference]: Start difference. First operand 8438 states and 12353 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:22:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:15,319 INFO L93 Difference]: Finished difference Result 14689 states and 21854 transitions. [2022-07-12 11:22:15,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:22:15,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 130 [2022-07-12 11:22:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:15,349 INFO L225 Difference]: With dead ends: 14689 [2022-07-12 11:22:15,350 INFO L226 Difference]: Without dead ends: 6299 [2022-07-12 11:22:15,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:15,392 INFO L413 NwaCegarLoop]: 1369 mSDtfsCounter, 0 mSDsluCounter, 4100 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:15,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5469 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:15,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6299 states. [2022-07-12 11:22:15,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6299 to 6285. [2022-07-12 11:22:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 4703 states have (on average 1.2925792047629172) internal successors, (6079), 4851 states have internal predecessors, (6079), 1195 states have call successors, (1195), 300 states have call predecessors, (1195), 386 states have return successors, (1863), 1175 states have call predecessors, (1863), 1191 states have call successors, (1863) [2022-07-12 11:22:15,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 9137 transitions. [2022-07-12 11:22:15,781 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 9137 transitions. Word has length 130 [2022-07-12 11:22:15,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:15,782 INFO L495 AbstractCegarLoop]: Abstraction has 6285 states and 9137 transitions. [2022-07-12 11:22:15,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 11:22:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 9137 transitions. [2022-07-12 11:22:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 11:22:15,785 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:15,785 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-07-12 11:22:15,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:16,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:16,012 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:16,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1718591214, now seen corresponding path program 1 times [2022-07-12 11:22:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:16,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717867929] [2022-07-12 11:22:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:16,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:22:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:22:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:22:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:22:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:22:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:22:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:22:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 11:22:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:16,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717867929] [2022-07-12 11:22:16,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717867929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:16,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696080768] [2022-07-12 11:22:16,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:16,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:16,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:16,586 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:16,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 11:22:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:17,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 2949 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:22:17,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-07-12 11:22:17,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:17,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696080768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:17,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:17,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [13] total 15 [2022-07-12 11:22:17,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729045415] [2022-07-12 11:22:17,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:17,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 11:22:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:17,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 11:22:17,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:17,608 INFO L87 Difference]: Start difference. First operand 6285 states and 9137 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:22:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:17,859 INFO L93 Difference]: Finished difference Result 12522 states and 18220 transitions. [2022-07-12 11:22:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:22:17,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 128 [2022-07-12 11:22:17,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:17,886 INFO L225 Difference]: With dead ends: 12522 [2022-07-12 11:22:17,886 INFO L226 Difference]: Without dead ends: 6285 [2022-07-12 11:22:17,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:17,911 INFO L413 NwaCegarLoop]: 1372 mSDtfsCounter, 22 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 4072 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:17,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 4072 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6285 states. [2022-07-12 11:22:18,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6285 to 6285. [2022-07-12 11:22:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6285 states, 4703 states have (on average 1.2915160535828194) internal successors, (6074), 4851 states have internal predecessors, (6074), 1195 states have call successors, (1195), 300 states have call predecessors, (1195), 386 states have return successors, (1863), 1175 states have call predecessors, (1863), 1191 states have call successors, (1863) [2022-07-12 11:22:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6285 states to 6285 states and 9132 transitions. [2022-07-12 11:22:18,184 INFO L78 Accepts]: Start accepts. Automaton has 6285 states and 9132 transitions. Word has length 128 [2022-07-12 11:22:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:18,184 INFO L495 AbstractCegarLoop]: Abstraction has 6285 states and 9132 transitions. [2022-07-12 11:22:18,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-12 11:22:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 6285 states and 9132 transitions. [2022-07-12 11:22:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 11:22:18,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:18,186 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:18,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:18,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:18,399 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:18,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1120501507, now seen corresponding path program 1 times [2022-07-12 11:22:18,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:18,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044600356] [2022-07-12 11:22:18,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:18,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:18,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:22:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:22:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:22:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:22:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:22:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:22:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:22:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:22:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:22:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-12 11:22:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 11:22:18,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:18,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044600356] [2022-07-12 11:22:18,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044600356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:18,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026650833] [2022-07-12 11:22:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:18,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:18,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:18,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:18,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 11:22:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:19,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 11:22:19,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:20,164 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:22:20,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-12 11:22:20,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026650833] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:20,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:22:20,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 6] total 18 [2022-07-12 11:22:20,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745176097] [2022-07-12 11:22:20,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:20,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:22:20,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:20,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:22:20,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-12 11:22:20,396 INFO L87 Difference]: Start difference. First operand 6285 states and 9132 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 5 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 11:22:22,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:22,518 INFO L93 Difference]: Finished difference Result 10504 states and 15730 transitions. [2022-07-12 11:22:22,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 11:22:22,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 5 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 130 [2022-07-12 11:22:22,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:22,568 INFO L225 Difference]: With dead ends: 10504 [2022-07-12 11:22:22,568 INFO L226 Difference]: Without dead ends: 10499 [2022-07-12 11:22:22,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-07-12 11:22:22,579 INFO L413 NwaCegarLoop]: 2144 mSDtfsCounter, 5080 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 1101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5080 SdHoareTripleChecker+Valid, 2871 SdHoareTripleChecker+Invalid, 1749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1101 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:22,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5080 Valid, 2871 Invalid, 1749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1101 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 11:22:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10499 states. [2022-07-12 11:22:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10499 to 10473. [2022-07-12 11:22:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10473 states, 7831 states have (on average 1.2911505554846123) internal successors, (10111), 8077 states have internal predecessors, (10111), 1997 states have call successors, (1997), 494 states have call predecessors, (1997), 644 states have return successors, (3586), 1971 states have call predecessors, (3586), 1993 states have call successors, (3586) [2022-07-12 11:22:23,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10473 states to 10473 states and 15694 transitions. [2022-07-12 11:22:23,135 INFO L78 Accepts]: Start accepts. Automaton has 10473 states and 15694 transitions. Word has length 130 [2022-07-12 11:22:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:23,136 INFO L495 AbstractCegarLoop]: Abstraction has 10473 states and 15694 transitions. [2022-07-12 11:22:23,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 5 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2022-07-12 11:22:23,136 INFO L276 IsEmpty]: Start isEmpty. Operand 10473 states and 15694 transitions. [2022-07-12 11:22:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-12 11:22:23,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:23,139 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:23,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:23,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-12 11:22:23,340 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:23,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:23,340 INFO L85 PathProgramCache]: Analyzing trace with hash -2046530365, now seen corresponding path program 1 times [2022-07-12 11:22:23,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:23,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757307472] [2022-07-12 11:22:23,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:23,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:22:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:22:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:22:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:22:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:22:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:22:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:22:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:22:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:22:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:22:23,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:23,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 11:22:23,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757307472] [2022-07-12 11:22:23,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757307472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:23,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257231661] [2022-07-12 11:22:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:23,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:23,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:23,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:23,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 11:22:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:24,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 3106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:22:24,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:22:24,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:24,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [257231661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:24,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:24,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2022-07-12 11:22:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492972116] [2022-07-12 11:22:24,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:24,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:22:24,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:24,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:22:24,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:24,886 INFO L87 Difference]: Start difference. First operand 10473 states and 15694 transitions. Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:22:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:25,715 INFO L93 Difference]: Finished difference Result 25908 states and 40840 transitions. [2022-07-12 11:22:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:22:25,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2022-07-12 11:22:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:25,810 INFO L225 Difference]: With dead ends: 25908 [2022-07-12 11:22:25,811 INFO L226 Difference]: Without dead ends: 15483 [2022-07-12 11:22:25,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-12 11:22:25,893 INFO L413 NwaCegarLoop]: 1889 mSDtfsCounter, 1067 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 6707 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:25,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 6707 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:22:25,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2022-07-12 11:22:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 10553. [2022-07-12 11:22:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10553 states, 7901 states have (on average 1.2898367295279078) internal successors, (10191), 8147 states have internal predecessors, (10191), 2007 states have call successors, (2007), 494 states have call predecessors, (2007), 644 states have return successors, (3596), 1981 states have call predecessors, (3596), 2003 states have call successors, (3596) [2022-07-12 11:22:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10553 states to 10553 states and 15794 transitions. [2022-07-12 11:22:26,687 INFO L78 Accepts]: Start accepts. Automaton has 10553 states and 15794 transitions. Word has length 148 [2022-07-12 11:22:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:26,688 INFO L495 AbstractCegarLoop]: Abstraction has 10553 states and 15794 transitions. [2022-07-12 11:22:26,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 5 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:22:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 10553 states and 15794 transitions. [2022-07-12 11:22:26,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-12 11:22:26,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:26,691 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:26,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:26,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:26,920 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:26,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:26,920 INFO L85 PathProgramCache]: Analyzing trace with hash -118257663, now seen corresponding path program 1 times [2022-07-12 11:22:26,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:26,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591453229] [2022-07-12 11:22:26,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:26,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:22:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:22:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:22:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:22:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:22:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:22:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:22:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:22:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:22:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:22:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-12 11:22:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 11:22:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:27,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591453229] [2022-07-12 11:22:27,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591453229] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:27,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463150122] [2022-07-12 11:22:27,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:27,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:27,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:27,376 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 11:22:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:28,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 3099 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 11:22:28,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:22:28,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:28,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463150122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:28,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:28,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-07-12 11:22:28,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589386192] [2022-07-12 11:22:28,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:28,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 11:22:28,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:28,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 11:22:28,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:28,411 INFO L87 Difference]: Start difference. First operand 10553 states and 15794 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:22:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:28,842 INFO L93 Difference]: Finished difference Result 20588 states and 31782 transitions. [2022-07-12 11:22:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 11:22:28,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 148 [2022-07-12 11:22:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:28,891 INFO L225 Difference]: With dead ends: 20588 [2022-07-12 11:22:28,891 INFO L226 Difference]: Without dead ends: 9887 [2022-07-12 11:22:28,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:22:28,963 INFO L413 NwaCegarLoop]: 1300 mSDtfsCounter, 3 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:28,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2595 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:28,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9887 states. [2022-07-12 11:22:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9887 to 9887. [2022-07-12 11:22:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9887 states, 7285 states have (on average 1.2797529169526425) internal successors, (9323), 7531 states have internal predecessors, (9323), 1957 states have call successors, (1957), 494 states have call predecessors, (1957), 644 states have return successors, (3532), 1931 states have call predecessors, (3532), 1953 states have call successors, (3532) [2022-07-12 11:22:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9887 states to 9887 states and 14812 transitions. [2022-07-12 11:22:29,471 INFO L78 Accepts]: Start accepts. Automaton has 9887 states and 14812 transitions. Word has length 148 [2022-07-12 11:22:29,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:29,471 INFO L495 AbstractCegarLoop]: Abstraction has 9887 states and 14812 transitions. [2022-07-12 11:22:29,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-12 11:22:29,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9887 states and 14812 transitions. [2022-07-12 11:22:29,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 11:22:29,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:29,476 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:29,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:29,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:29,704 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:29,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash -956951615, now seen corresponding path program 1 times [2022-07-12 11:22:29,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:29,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490596989] [2022-07-12 11:22:29,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:29,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:29,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:22:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:22:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:22:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:22:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:22:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:22:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:22:30,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:30,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:22:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:22:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 11:22:30,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:30,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490596989] [2022-07-12 11:22:30,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490596989] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:30,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639923791] [2022-07-12 11:22:30,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:30,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:30,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:30,408 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:30,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 11:22:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:31,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 11:22:31,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:31,493 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-12 11:22:31,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:31,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639923791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:31,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:31,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 14 [2022-07-12 11:22:31,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347930482] [2022-07-12 11:22:31,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:31,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:22:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:31,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:22:31,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:22:31,496 INFO L87 Difference]: Start difference. First operand 9887 states and 14812 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:22:31,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:31,975 INFO L93 Difference]: Finished difference Result 19704 states and 30481 transitions. [2022-07-12 11:22:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:22:31,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2022-07-12 11:22:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:32,026 INFO L225 Difference]: With dead ends: 19704 [2022-07-12 11:22:32,027 INFO L226 Difference]: Without dead ends: 9849 [2022-07-12 11:22:32,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:32,082 INFO L413 NwaCegarLoop]: 1278 mSDtfsCounter, 4 mSDsluCounter, 10184 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11462 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:32,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11462 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:22:32,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9849 states. [2022-07-12 11:22:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9849 to 9828. [2022-07-12 11:22:32,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9828 states, 7244 states have (on average 1.2763666482606295) internal successors, (9246), 7471 states have internal predecessors, (9246), 1937 states have call successors, (1937), 489 states have call predecessors, (1937), 646 states have return successors, (3522), 1937 states have call predecessors, (3522), 1933 states have call successors, (3522) [2022-07-12 11:22:32,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9828 states to 9828 states and 14705 transitions. [2022-07-12 11:22:32,661 INFO L78 Accepts]: Start accepts. Automaton has 9828 states and 14705 transitions. Word has length 161 [2022-07-12 11:22:32,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:32,661 INFO L495 AbstractCegarLoop]: Abstraction has 9828 states and 14705 transitions. [2022-07-12 11:22:32,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:22:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 9828 states and 14705 transitions. [2022-07-12 11:22:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 11:22:32,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:32,667 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:32,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:32,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 11:22:32,880 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:32,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:32,880 INFO L85 PathProgramCache]: Analyzing trace with hash -812541920, now seen corresponding path program 1 times [2022-07-12 11:22:32,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:32,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073426237] [2022-07-12 11:22:32,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:32,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:33,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:22:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:22:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:22:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:22:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:22:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:22:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:22:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:22:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:33,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:22:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 11:22:33,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:33,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073426237] [2022-07-12 11:22:33,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073426237] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:33,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352427019] [2022-07-12 11:22:33,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:33,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:33,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:33,523 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:33,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 11:22:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:34,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 3131 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 11:22:34,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 11:22:34,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:34,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352427019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:34,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:34,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2022-07-12 11:22:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109838885] [2022-07-12 11:22:34,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:34,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:22:34,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:34,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:22:34,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:22:34,764 INFO L87 Difference]: Start difference. First operand 9828 states and 14705 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:22:35,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:35,213 INFO L93 Difference]: Finished difference Result 17815 states and 27523 transitions. [2022-07-12 11:22:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:22:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2022-07-12 11:22:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:35,255 INFO L225 Difference]: With dead ends: 17815 [2022-07-12 11:22:35,256 INFO L226 Difference]: Without dead ends: 9867 [2022-07-12 11:22:35,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:22:35,298 INFO L413 NwaCegarLoop]: 1279 mSDtfsCounter, 3 mSDsluCounter, 10212 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11491 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:35,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11491 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2022-07-12 11:22:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9867. [2022-07-12 11:22:35,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9867 states, 7275 states have (on average 1.2758762886597939) internal successors, (9282), 7496 states have internal predecessors, (9282), 1937 states have call successors, (1937), 489 states have call predecessors, (1937), 654 states have return successors, (3548), 1951 states have call predecessors, (3548), 1933 states have call successors, (3548) [2022-07-12 11:22:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9867 states to 9867 states and 14767 transitions. [2022-07-12 11:22:35,967 INFO L78 Accepts]: Start accepts. Automaton has 9867 states and 14767 transitions. Word has length 161 [2022-07-12 11:22:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:35,967 INFO L495 AbstractCegarLoop]: Abstraction has 9867 states and 14767 transitions. [2022-07-12 11:22:35,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:22:35,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9867 states and 14767 transitions. [2022-07-12 11:22:35,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 11:22:35,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:35,973 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:36,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 11:22:36,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 11:22:36,199 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash 491851809, now seen corresponding path program 2 times [2022-07-12 11:22:36,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:36,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622802443] [2022-07-12 11:22:36,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:36,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:36,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:22:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:22:36,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:22:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:22:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:22:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:22:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-12 11:22:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-12 11:22:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-12 11:22:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-12 11:22:36,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:36,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622802443] [2022-07-12 11:22:36,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622802443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:36,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011626238] [2022-07-12 11:22:36,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 11:22:36,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:36,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:36,790 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:36,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 11:22:38,015 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 11:22:38,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 11:22:38,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 3140 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 11:22:38,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 11:22:38,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:22:38,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011626238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:22:38,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:22:38,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 14 [2022-07-12 11:22:38,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823552604] [2022-07-12 11:22:38,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:22:38,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:22:38,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:22:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:22:38,101 INFO L87 Difference]: Start difference. First operand 9867 states and 14767 transitions. Second operand has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:22:38,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:22:38,535 INFO L93 Difference]: Finished difference Result 19686 states and 30443 transitions. [2022-07-12 11:22:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:22:38,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) Word has length 161 [2022-07-12 11:22:38,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:22:38,590 INFO L225 Difference]: With dead ends: 19686 [2022-07-12 11:22:38,591 INFO L226 Difference]: Without dead ends: 9867 [2022-07-12 11:22:38,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 197 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:22:38,659 INFO L413 NwaCegarLoop]: 1289 mSDtfsCounter, 2 mSDsluCounter, 10281 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11570 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:22:38,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11570 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:22:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9867 states. [2022-07-12 11:22:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9867 to 9849. [2022-07-12 11:22:39,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9849 states, 7259 states have (on average 1.275244524039124) internal successors, (9257), 7485 states have internal predecessors, (9257), 1937 states have call successors, (1937), 489 states have call predecessors, (1937), 652 states have return successors, (3538), 1944 states have call predecessors, (3538), 1933 states have call successors, (3538) [2022-07-12 11:22:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 14732 transitions. [2022-07-12 11:22:39,186 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 14732 transitions. Word has length 161 [2022-07-12 11:22:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:22:39,186 INFO L495 AbstractCegarLoop]: Abstraction has 9849 states and 14732 transitions. [2022-07-12 11:22:39,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.5) internal successors, (105), 7 states have internal predecessors, (105), 2 states have call successors, (22), 2 states have call predecessors, (22), 5 states have return successors, (21), 5 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:22:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 14732 transitions. [2022-07-12 11:22:39,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 11:22:39,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:22:39,193 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:22:39,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 11:22:39,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 11:22:39,416 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:22:39,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:22:39,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2002822577, now seen corresponding path program 1 times [2022-07-12 11:22:39,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:22:39,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695428548] [2022-07-12 11:22:39,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:39,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:22:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:22:39,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:22:39,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:22:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:22:40,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:22:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:22:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:22:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:22:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:22:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:22:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:22:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:22:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:22:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:22:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:22:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:22:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:22:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 11:22:40,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:22:40,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695428548] [2022-07-12 11:22:40,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695428548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:40,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858140443] [2022-07-12 11:22:40,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:22:40,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:22:40,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:22:40,291 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:22:40,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 11:22:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:22:41,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 3163 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 11:22:41,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:22:41,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 11:22:43,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:22:43,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 11:22:43,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:22:43,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:22:43,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 11:22:43,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:22:43,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:22:43,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 11:22:43,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:22:43,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:22:43,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 11:22:43,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:22:43,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:22:43,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 11:22:43,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:22:43,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:22:43,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 11:22:43,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:22:43,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:22:43,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 11:22:43,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:22:43,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-07-12 11:22:43,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 11:22:43,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:22:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:22:43,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:22:43,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858140443] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:22:43,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:22:43,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 32 [2022-07-12 11:22:43,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055856335] [2022-07-12 11:22:43,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:22:43,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 11:22:43,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:22:43,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 11:22:43,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=937, Unknown=20, NotChecked=0, Total=1056 [2022-07-12 11:22:43,701 INFO L87 Difference]: Start difference. First operand 9849 states and 14732 transitions. Second operand has 32 states, 32 states have (on average 5.40625) internal successors, (173), 23 states have internal predecessors, (173), 14 states have call successors, (39), 9 states have call predecessors, (39), 12 states have return successors, (36), 15 states have call predecessors, (36), 14 states have call successors, (36) [2022-07-12 11:22:53,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:07,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:07,797 INFO L93 Difference]: Finished difference Result 29550 states and 45636 transitions. [2022-07-12 11:23:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-07-12 11:23:07,798 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 5.40625) internal successors, (173), 23 states have internal predecessors, (173), 14 states have call successors, (39), 9 states have call predecessors, (39), 12 states have return successors, (36), 15 states have call predecessors, (36), 14 states have call successors, (36) Word has length 163 [2022-07-12 11:23:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:07,877 INFO L225 Difference]: With dead ends: 29550 [2022-07-12 11:23:07,877 INFO L226 Difference]: Without dead ends: 19749 [2022-07-12 11:23:07,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=509, Invalid=4153, Unknown=30, NotChecked=0, Total=4692 [2022-07-12 11:23:07,925 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 2544 mSDsluCounter, 12059 mSDsCounter, 0 mSdLazyCounter, 15762 mSolverCounterSat, 1088 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2664 SdHoareTripleChecker+Valid, 13535 SdHoareTripleChecker+Invalid, 18332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1088 IncrementalHoareTripleChecker+Valid, 15762 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 1481 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:07,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2664 Valid, 13535 Invalid, 18332 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1088 Valid, 15762 Invalid, 1 Unknown, 1481 Unchecked, 22.1s Time] [2022-07-12 11:23:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19749 states. [2022-07-12 11:23:08,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19749 to 17683. [2022-07-12 11:23:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17683 states, 12980 states have (on average 1.263482280431433) internal successors, (16400), 13422 states have internal predecessors, (16400), 3362 states have call successors, (3362), 941 states have call predecessors, (3362), 1340 states have return successors, (6800), 3439 states have call predecessors, (6800), 3358 states have call successors, (6800) [2022-07-12 11:23:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17683 states to 17683 states and 26562 transitions. [2022-07-12 11:23:09,001 INFO L78 Accepts]: Start accepts. Automaton has 17683 states and 26562 transitions. Word has length 163 [2022-07-12 11:23:09,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:09,002 INFO L495 AbstractCegarLoop]: Abstraction has 17683 states and 26562 transitions. [2022-07-12 11:23:09,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 5.40625) internal successors, (173), 23 states have internal predecessors, (173), 14 states have call successors, (39), 9 states have call predecessors, (39), 12 states have return successors, (36), 15 states have call predecessors, (36), 14 states have call successors, (36) [2022-07-12 11:23:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 17683 states and 26562 transitions. [2022-07-12 11:23:09,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 11:23:09,009 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:09,009 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:09,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 11:23:09,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 11:23:09,223 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:09,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 119108019, now seen corresponding path program 1 times [2022-07-12 11:23:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:23:09,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821580148] [2022-07-12 11:23:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:23:09,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:23:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:23:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:23:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:23:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:23:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:23:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:23:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:23:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:23:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:23:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-12 11:23:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-12 11:23:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-12 11:23:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:23:09,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:23:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:23:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:23:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:23:09,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-12 11:23:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-12 11:23:09,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:23:09,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821580148] [2022-07-12 11:23:09,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821580148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:23:09,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:23:09,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:23:09,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919251947] [2022-07-12 11:23:09,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:23:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:23:09,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:23:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:23:09,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:23:09,648 INFO L87 Difference]: Start difference. First operand 17683 states and 26562 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:23:12,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:23:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:23:15,971 INFO L93 Difference]: Finished difference Result 34452 states and 54349 transitions. [2022-07-12 11:23:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:23:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 166 [2022-07-12 11:23:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:23:16,051 INFO L225 Difference]: With dead ends: 34452 [2022-07-12 11:23:16,052 INFO L226 Difference]: Without dead ends: 16817 [2022-07-12 11:23:16,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:23:16,145 INFO L413 NwaCegarLoop]: 840 mSDtfsCounter, 789 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 387 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2833 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:23:16,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2833 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1672 Invalid, 1 Unknown, 0 Unchecked, 5.6s Time] [2022-07-12 11:23:16,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16817 states. [2022-07-12 11:23:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16817 to 14948. [2022-07-12 11:23:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14948 states, 11026 states have (on average 1.250226736803918) internal successors, (13785), 11411 states have internal predecessors, (13785), 2623 states have call successors, (2623), 901 states have call predecessors, (2623), 1298 states have return successors, (5270), 2755 states have call predecessors, (5270), 2619 states have call successors, (5270) [2022-07-12 11:23:16,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14948 states to 14948 states and 21678 transitions. [2022-07-12 11:23:16,781 INFO L78 Accepts]: Start accepts. Automaton has 14948 states and 21678 transitions. Word has length 166 [2022-07-12 11:23:16,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:23:16,781 INFO L495 AbstractCegarLoop]: Abstraction has 14948 states and 21678 transitions. [2022-07-12 11:23:16,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 4 states have internal predecessors, (103), 3 states have call successors, (23), 5 states have call predecessors, (23), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-12 11:23:16,781 INFO L276 IsEmpty]: Start isEmpty. Operand 14948 states and 21678 transitions. [2022-07-12 11:23:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 11:23:16,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:23:16,784 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:23:16,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 11:23:16,784 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:23:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:23:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 644781777, now seen corresponding path program 1 times [2022-07-12 11:23:16,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:23:16,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526060404] [2022-07-12 11:23:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:23:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:23:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:23:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:23:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:23:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:23:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:23:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:23:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:23:17,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:23:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:23:17,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:23:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:23:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:23:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:23:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:23:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:23:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:23:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:23:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 11:23:17,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:23:17,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526060404] [2022-07-12 11:23:17,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526060404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:23:17,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453572314] [2022-07-12 11:23:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:23:17,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:23:17,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:23:17,604 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:23:17,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 11:23:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:23:18,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 3164 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-12 11:23:18,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:23:19,383 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:23:19,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 11:23:19,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:23:19,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:23:19,461 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:23:19,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-12 11:23:19,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:23:19,505 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:23:19,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-12 11:23:19,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:23:19,555 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:23:19,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-12 11:23:19,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:23:19,596 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:23:19,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-12 11:23:19,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:23:19,660 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 11:23:19,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-12 11:23:19,784 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 11:23:19,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2022-07-12 11:23:20,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:23:20,047 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 11:23:20,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:23:20,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-12 11:23:20,345 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_14166 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ttusb_dec_probe_ttusb_dec_init_usb_~dec#1.base| v_ArrVal_14166) |c_~#debug~0.base|) |c_~#debug~0.offset|) 0)) (= (select |c_old(#valid)| |c_~#debug~0.base|) 0)) is different from false [2022-07-12 11:23:20,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453572314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:23:20,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:23:20,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 37 [2022-07-12 11:23:20,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276528066] [2022-07-12 11:23:20,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:23:20,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 11:23:20,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:23:20,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 11:23:20,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1355, Unknown=1, NotChecked=74, Total=1560 [2022-07-12 11:23:20,365 INFO L87 Difference]: Start difference. First operand 14948 states and 21678 transitions. Second operand has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 28 states have internal predecessors, (215), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-12 11:23:28,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:07,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:07,556 INFO L93 Difference]: Finished difference Result 55298 states and 92671 transitions. [2022-07-12 11:24:07,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-07-12 11:24:07,556 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 28 states have internal predecessors, (215), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 15 states have call successors, (36) Word has length 163 [2022-07-12 11:24:07,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:07,750 INFO L225 Difference]: With dead ends: 55298 [2022-07-12 11:24:07,750 INFO L226 Difference]: Without dead ends: 40398 [2022-07-12 11:24:07,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 261 SyntacticMatches, 6 SemanticMatches, 169 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10323 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2669, Invalid=26064, Unknown=1, NotChecked=336, Total=29070 [2022-07-12 11:24:07,816 INFO L413 NwaCegarLoop]: 1136 mSDtfsCounter, 7736 mSDsluCounter, 12865 mSDsCounter, 0 mSdLazyCounter, 36856 mSolverCounterSat, 4307 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7922 SdHoareTripleChecker+Valid, 14001 SdHoareTripleChecker+Invalid, 43863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4307 IncrementalHoareTripleChecker+Valid, 36856 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 2699 IncrementalHoareTripleChecker+Unchecked, 40.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:07,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7922 Valid, 14001 Invalid, 43863 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4307 Valid, 36856 Invalid, 1 Unknown, 2699 Unchecked, 40.0s Time] [2022-07-12 11:24:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40398 states. [2022-07-12 11:24:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40398 to 35031. [2022-07-12 11:24:09,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35031 states, 25909 states have (on average 1.2407657570728319) internal successors, (32147), 26819 states have internal predecessors, (32147), 6055 states have call successors, (6055), 2074 states have call predecessors, (6055), 3066 states have return successors, (16476), 6302 states have call predecessors, (16476), 6051 states have call successors, (16476) [2022-07-12 11:24:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35031 states to 35031 states and 54678 transitions. [2022-07-12 11:24:10,137 INFO L78 Accepts]: Start accepts. Automaton has 35031 states and 54678 transitions. Word has length 163 [2022-07-12 11:24:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:10,138 INFO L495 AbstractCegarLoop]: Abstraction has 35031 states and 54678 transitions. [2022-07-12 11:24:10,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 5.8108108108108105) internal successors, (215), 28 states have internal predecessors, (215), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 15 states have call successors, (36) [2022-07-12 11:24:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 35031 states and 54678 transitions. [2022-07-12 11:24:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-12 11:24:10,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:10,141 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:24:10,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 11:24:10,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:24:10,350 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:10,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:10,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1043495825, now seen corresponding path program 1 times [2022-07-12 11:24:10,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:24:10,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767488089] [2022-07-12 11:24:10,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:10,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:24:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:10,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:24:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:10,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:24:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:24:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:24:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:24:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:24:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:24:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-12 11:24:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:24:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 11:24:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-12 11:24:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-12 11:24:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-12 11:24:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:24:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:24:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:24:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:24:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-12 11:24:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-12 11:24:11,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:24:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767488089] [2022-07-12 11:24:11,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767488089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:24:11,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439842438] [2022-07-12 11:24:11,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:11,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:24:11,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:24:11,399 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 11:24:11,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 11:24:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:12,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 3166 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 11:24:12,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:24:12,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 11:24:13,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:24:13,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:24:13,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:24:13,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:24:13,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:24:13,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:24:13,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:24:13,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:24:13,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:24:13,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 11:24:13,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 11:24:13,794 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 11:24:13,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:24:14,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439842438] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:24:14,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:24:14,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2022-07-12 11:24:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670487623] [2022-07-12 11:24:14,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:24:14,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 11:24:14,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:24:14,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 11:24:14,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1280, Unknown=10, NotChecked=0, Total=1406 [2022-07-12 11:24:14,059 INFO L87 Difference]: Start difference. First operand 35031 states and 54678 transitions. Second operand has 36 states, 36 states have (on average 5.583333333333333) internal successors, (201), 27 states have internal predecessors, (201), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-12 11:24:19,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:38,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:38,532 INFO L93 Difference]: Finished difference Result 74281 states and 119988 transitions. [2022-07-12 11:24:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-12 11:24:38,532 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.583333333333333) internal successors, (201), 27 states have internal predecessors, (201), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 16 states have call successors, (36) Word has length 163 [2022-07-12 11:24:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:38,899 INFO L225 Difference]: With dead ends: 74281 [2022-07-12 11:24:38,899 INFO L226 Difference]: Without dead ends: 39415 [2022-07-12 11:24:39,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 234 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1445 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=556, Invalid=4975, Unknown=19, NotChecked=0, Total=5550 [2022-07-12 11:24:39,112 INFO L413 NwaCegarLoop]: 912 mSDtfsCounter, 3372 mSDsluCounter, 8156 mSDsCounter, 0 mSdLazyCounter, 14681 mSolverCounterSat, 1433 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 9068 SdHoareTripleChecker+Invalid, 16999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1433 IncrementalHoareTripleChecker+Valid, 14681 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 884 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:39,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 9068 Invalid, 16999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1433 Valid, 14681 Invalid, 1 Unknown, 884 Unchecked, 21.3s Time] [2022-07-12 11:24:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39415 states. [2022-07-12 11:24:40,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39415 to 35547. [2022-07-12 11:24:40,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35547 states, 26244 states have (on average 1.2385688157293095) internal successors, (32505), 27191 states have internal predecessors, (32505), 6122 states have call successors, (6122), 2131 states have call predecessors, (6122), 3180 states have return successors, (16636), 6389 states have call predecessors, (16636), 6118 states have call successors, (16636) [2022-07-12 11:24:41,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35547 states to 35547 states and 55263 transitions. [2022-07-12 11:24:41,059 INFO L78 Accepts]: Start accepts. Automaton has 35547 states and 55263 transitions. Word has length 163 [2022-07-12 11:24:41,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:41,060 INFO L495 AbstractCegarLoop]: Abstraction has 35547 states and 55263 transitions. [2022-07-12 11:24:41,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.583333333333333) internal successors, (201), 27 states have internal predecessors, (201), 16 states have call successors, (40), 10 states have call predecessors, (40), 12 states have return successors, (36), 17 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-12 11:24:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 35547 states and 55263 transitions. [2022-07-12 11:24:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-12 11:24:41,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:41,063 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:24:41,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 11:24:41,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 11:24:41,264 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:41,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:41,264 INFO L85 PathProgramCache]: Analyzing trace with hash -437206204, now seen corresponding path program 1 times [2022-07-12 11:24:41,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:24:41,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275706755] [2022-07-12 11:24:41,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:41,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:24:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:24:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:24:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:24:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:24:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:24:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:24:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:24:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 11:24:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-12 11:24:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-12 11:24:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-12 11:24:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-12 11:24:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:24:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-12 11:24:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-12 11:24:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:24:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:24:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-12 11:24:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-12 11:24:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-12 11:24:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:24:41,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275706755] [2022-07-12 11:24:41,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275706755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:41,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:41,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:24:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361989168] [2022-07-12 11:24:41,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:41,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:24:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:24:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:24:41,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:24:41,614 INFO L87 Difference]: Start difference. First operand 35547 states and 55263 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 11:24:44,756 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 11:24:50,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:24:50,635 INFO L93 Difference]: Finished difference Result 74917 states and 129586 transitions. [2022-07-12 11:24:50,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:24:50,637 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 166 [2022-07-12 11:24:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:24:50,833 INFO L225 Difference]: With dead ends: 74917 [2022-07-12 11:24:50,833 INFO L226 Difference]: Without dead ends: 39418 [2022-07-12 11:24:50,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:24:50,991 INFO L413 NwaCegarLoop]: 781 mSDtfsCounter, 615 mSDsluCounter, 1957 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 241 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:24:50,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 2738 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 2285 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2022-07-12 11:24:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39418 states. [2022-07-12 11:24:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39418 to 35664. [2022-07-12 11:24:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35664 states, 26322 states have (on average 1.238203783906998) internal successors, (32592), 27269 states have internal predecessors, (32592), 6142 states have call successors, (6142), 2146 states have call predecessors, (6142), 3199 states have return successors, (16757), 6413 states have call predecessors, (16757), 6138 states have call successors, (16757) [2022-07-12 11:24:53,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35664 states to 35664 states and 55491 transitions. [2022-07-12 11:24:53,461 INFO L78 Accepts]: Start accepts. Automaton has 35664 states and 55491 transitions. Word has length 166 [2022-07-12 11:24:53,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:24:53,461 INFO L495 AbstractCegarLoop]: Abstraction has 35664 states and 55491 transitions. [2022-07-12 11:24:53,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 4 states have internal predecessors, (107), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2022-07-12 11:24:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 35664 states and 55491 transitions. [2022-07-12 11:24:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-12 11:24:53,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:24:53,465 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:24:53,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 11:24:53,466 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:24:53,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:24:53,466 INFO L85 PathProgramCache]: Analyzing trace with hash -567852612, now seen corresponding path program 1 times [2022-07-12 11:24:53,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:24:53,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885756245] [2022-07-12 11:24:53,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:24:53,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:24:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-12 11:24:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-12 11:24:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:24:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:24:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:24:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:24:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-12 11:24:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 11:24:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:24:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 11:24:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 11:24:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-12 11:24:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-12 11:24:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 11:24:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 11:24:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:24:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-12 11:24:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-12 11:24:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:53,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 11:24:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:24:54,003 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-12 11:24:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:24:54,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885756245] [2022-07-12 11:24:54,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885756245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:24:54,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:24:54,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:24:54,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594611557] [2022-07-12 11:24:54,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:24:54,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:24:54,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:24:54,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:24:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:24:54,007 INFO L87 Difference]: Start difference. First operand 35664 states and 55491 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 3 states have call successors, (22), 6 states have call predecessors, (22), 3 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19)