./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.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 f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:21:10,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:21:10,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:21:10,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:21:10,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:21:10,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:21:10,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:21:10,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:21:10,585 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:21:10,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:21:10,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:21:10,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:21:10,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:21:10,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:21:10,597 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:21:10,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:21:10,599 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:21:10,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:21:10,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:21:10,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:21:10,612 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:21:10,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:21:10,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:21:10,615 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:21:10,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:21:10,619 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:21:10,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:21:10,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:21:10,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:21:10,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:21:10,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:21:10,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:21:10,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:21:10,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:21:10,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:21:10,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:21:10,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:21:10,626 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:21:10,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:21:10,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:21:10,627 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:21:10,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:21:10,630 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:21:10,661 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:21:10,662 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:21:10,662 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:21:10,662 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:21:10,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:21:10,663 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:21:10,664 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:21:10,664 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:21:10,664 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:21:10,665 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:21:10,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:21:10,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:21:10,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:21:10,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:21:10,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:21:10,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:21:10,666 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:21:10,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:21:10,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:21:10,668 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:21:10,668 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:21:10,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:21:10,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:21:10,669 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:21:10,669 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:21:10,669 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:21:10,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:21:10,670 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:21:10,670 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:21:10,670 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:21:10,670 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 -> f81c0ae249d872dcfa63b19fa0949c00123fc4e906e065a111b2d70e300e79eb [2022-07-19 22:21:10,925 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:21:10,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:21:10,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:21:10,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:21:10,954 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:21:10,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-19 22:21:11,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7ff5cb7/7f067ecd6d3c4603a267fcc519c61153/FLAGafa952ba1 [2022-07-19 22:21:11,768 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:21:11,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-19 22:21:11,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7ff5cb7/7f067ecd6d3c4603a267fcc519c61153/FLAGafa952ba1 [2022-07-19 22:21:11,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb7ff5cb7/7f067ecd6d3c4603a267fcc519c61153 [2022-07-19 22:21:11,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:21:11,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:21:11,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:21:11,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:21:11,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:21:11,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:21:11" (1/1) ... [2022-07-19 22:21:11,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511b2764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:11, skipping insertion in model container [2022-07-19 22:21:11,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:21:11" (1/1) ... [2022-07-19 22:21:11,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:21:11,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:21:13,550 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/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2022-07-19 22:21:13,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:21:13,645 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:21:13,997 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/module_get_put-drivers-block-pktcdvd.ko.cil.out.i[265142,265155] [2022-07-19 22:21:14,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:21:14,100 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:21:14,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14 WrapperNode [2022-07-19 22:21:14,102 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:21:14,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:21:14,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:21:14,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:21:14,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,205 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,344 INFO L137 Inliner]: procedures = 309, calls = 2432, calls flagged for inlining = 139, calls inlined = 90, statements flattened = 3953 [2022-07-19 22:21:14,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:21:14,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:21:14,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:21:14,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:21:14,353 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,398 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:21:14,530 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:21:14,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:21:14,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:21:14,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (1/1) ... [2022-07-19 22:21:14,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:21:14,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:14,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 22:21:14,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 22:21:14,611 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-19 22:21:14,611 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-19 22:21:14,611 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-19 22:21:14,611 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-19 22:21:14,611 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_ctl_ioctl [2022-07-19 22:21:14,612 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_ctl_ioctl [2022-07-19 22:21:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_release [2022-07-19 22:21:14,612 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_release [2022-07-19 22:21:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure bdev_get_queue [2022-07-19 22:21:14,612 INFO L138 BoogieDeclarations]: Found implementation of procedure bdev_get_queue [2022-07-19 22:21:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-19 22:21:14,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-19 22:21:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_disc_info [2022-07-19 22:21:14,613 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_disc_info [2022-07-19 22:21:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_bio_alloc [2022-07-19 22:21:14,613 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_bio_alloc [2022-07-19 22:21:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 22:21:14,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 22:21:14,613 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_setup_dev [2022-07-19 22:21:14,614 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_setup_dev [2022-07-19 22:21:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-19 22:21:14,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-19 22:21:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure bdget [2022-07-19 22:21:14,614 INFO L138 BoogieDeclarations]: Found implementation of procedure bdget [2022-07-19 22:21:14,614 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_set_speed [2022-07-19 22:21:14,614 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_set_speed [2022-07-19 22:21:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure bdevname [2022-07-19 22:21:14,615 INFO L138 BoogieDeclarations]: Found implementation of procedure bdevname [2022-07-19 22:21:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-19 22:21:14,615 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-19 22:21:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_shrink_pktlist [2022-07-19 22:21:14,615 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_shrink_pktlist [2022-07-19 22:21:14,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-19 22:21:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-19 22:21:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-19 22:21:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-19 22:21:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-19 22:21:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-19 22:21:14,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-19 22:21:14,616 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-19 22:21:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2022-07-19 22:21:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2022-07-19 22:21:14,617 INFO L130 BoogieDeclarations]: Found specification of procedure new_encode_dev [2022-07-19 22:21:14,617 INFO L138 BoogieDeclarations]: Found implementation of procedure new_encode_dev [2022-07-19 22:21:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-19 22:21:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-19 22:21:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_select [2022-07-19 22:21:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_select [2022-07-19 22:21:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_remove [2022-07-19 22:21:14,618 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_remove [2022-07-19 22:21:14,618 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-19 22:21:14,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-19 22:21:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_debugfs_cleanup [2022-07-19 22:21:14,619 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_debugfs_cleanup [2022-07-19 22:21:14,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:21:14,620 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-19 22:21:14,620 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-19 22:21:14,621 INFO L130 BoogieDeclarations]: Found specification of procedure bio_init [2022-07-19 22:21:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_init [2022-07-19 22:21:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure set_blocksize [2022-07-19 22:21:14,622 INFO L138 BoogieDeclarations]: Found implementation of procedure set_blocksize [2022-07-19 22:21:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_dump_sense [2022-07-19 22:21:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_dump_sense [2022-07-19 22:21:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_create_kmalloc_pool [2022-07-19 22:21:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_create_kmalloc_pool [2022-07-19 22:21:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2022-07-19 22:21:14,623 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2022-07-19 22:21:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:21:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure remove_proc_entry [2022-07-19 22:21:14,624 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_proc_entry [2022-07-19 22:21:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_lock_door [2022-07-19 22:21:14,624 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_lock_door [2022-07-19 22:21:14,624 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_get [2022-07-19 22:21:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_get [2022-07-19 22:21:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_remove_dev [2022-07-19 22:21:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_remove_dev [2022-07-19 22:21:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure __free_pages [2022-07-19 22:21:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __free_pages [2022-07-19 22:21:14,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-19 22:21:14,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-19 22:21:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:21:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure bio_put [2022-07-19 22:21:14,626 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_put [2022-07-19 22:21:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:21:14,626 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-19 22:21:14,627 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-19 22:21:14,627 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-19 22:21:14,627 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-19 22:21:14,627 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_remove [2022-07-19 22:21:14,627 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_remove [2022-07-19 22:21:14,627 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_create_dir [2022-07-19 22:21:14,628 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_create_dir [2022-07-19 22:21:14,628 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-19 22:21:14,628 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-19 22:21:14,628 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-19 22:21:14,629 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-19 22:21:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-19 22:21:14,629 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-19 22:21:14,629 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-19 22:21:14,630 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-19 22:21:14,630 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-19 22:21:14,630 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-19 22:21:14,630 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_sysfs_cleanup [2022-07-19 22:21:14,630 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_sysfs_cleanup [2022-07-19 22:21:14,631 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_init [2022-07-19 22:21:14,631 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_init [2022-07-19 22:21:14,631 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_find_dev_from_minor [2022-07-19 22:21:14,631 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_find_dev_from_minor [2022-07-19 22:21:14,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-19 22:21:14,631 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-19 22:21:14,631 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-19 22:21:14,631 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-19 22:21:14,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-19 22:21:14,632 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-19 22:21:14,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-19 22:21:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure init_write_congestion_marks [2022-07-19 22:21:14,633 INFO L138 BoogieDeclarations]: Found implementation of procedure init_write_congestion_marks [2022-07-19 22:21:14,633 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-19 22:21:14,634 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-19 22:21:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-19 22:21:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_track_info [2022-07-19 22:21:14,636 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_track_info [2022-07-19 22:21:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:21:14,637 INFO L130 BoogieDeclarations]: Found specification of procedure single_open [2022-07-19 22:21:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure single_open [2022-07-19 22:21:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-19 22:21:14,638 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-19 22:21:14,638 INFO L130 BoogieDeclarations]: Found specification of procedure new_decode_dev [2022-07-19 22:21:14,644 INFO L138 BoogieDeclarations]: Found implementation of procedure new_decode_dev [2022-07-19 22:21:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-19 22:21:14,644 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-19 22:21:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_create [2022-07-19 22:21:14,644 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_create [2022-07-19 22:21:14,644 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 22:21:14,645 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 22:21:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-19 22:21:14,645 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-19 22:21:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:21:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:21:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-19 22:21:14,645 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-19 22:21:14,645 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:21:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_put [2022-07-19 22:21:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_put [2022-07-19 22:21:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:21:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-19 22:21:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-19 22:21:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure queue_max_segments [2022-07-19 22:21:14,646 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_max_segments [2022-07-19 22:21:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_check_events [2022-07-19 22:21:14,647 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_check_events [2022-07-19 22:21:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure init_cdrom_command [2022-07-19 22:21:14,647 INFO L138 BoogieDeclarations]: Found implementation of procedure init_cdrom_command [2022-07-19 22:21:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-19 22:21:14,647 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-19 22:21:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_sense [2022-07-19 22:21:14,647 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_sense [2022-07-19 22:21:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-19 22:21:14,648 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-19 22:21:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_generic_packet [2022-07-19 22:21:14,648 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_generic_packet [2022-07-19 22:21:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-19 22:21:14,648 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-19 22:21:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-19 22:21:14,648 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-19 22:21:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_hw_sectors [2022-07-19 22:21:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_hw_sectors [2022-07-19 22:21:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_flush_cache [2022-07-19 22:21:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_flush_cache [2022-07-19 22:21:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:21:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:21:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:21:14,649 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-19 22:21:14,649 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-19 22:21:15,324 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:21:15,326 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:21:15,459 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:15,561 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-19 22:21:15,562 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-19 22:21:16,477 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:16,482 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:16,483 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:16,484 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:16,486 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:16,487 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:16,490 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##282: assume !false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##281: assume false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##214: assume !false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##213: assume false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##324: assume false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2022-07-19 22:21:21,995 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2022-07-19 22:21:21,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2022-07-19 22:21:21,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume !false; [2022-07-19 22:21:21,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##152: assume false; [2022-07-19 22:21:21,996 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume !false; [2022-07-19 22:21:22,024 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:21:22,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:21:22,042 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 22:21:22,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:21:22 BoogieIcfgContainer [2022-07-19 22:21:22,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:21:22,047 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:21:22,047 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:21:22,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:21:22,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:21:11" (1/3) ... [2022-07-19 22:21:22,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2ac2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:21:22, skipping insertion in model container [2022-07-19 22:21:22,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:21:14" (2/3) ... [2022-07-19 22:21:22,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2ac2a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:21:22, skipping insertion in model container [2022-07-19 22:21:22,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:21:22" (3/3) ... [2022-07-19 22:21:22,052 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-19 22:21:22,063 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:21:22,064 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:21:22,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:21:22,145 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@6fccc7f0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2be10fc9 [2022-07-19 22:21:22,145 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:21:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 1194 states, 856 states have (on average 1.3294392523364487) internal successors, (1138), 876 states have internal predecessors, (1138), 257 states have call successors, (257), 79 states have call predecessors, (257), 79 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) [2022-07-19 22:21:22,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-19 22:21:22,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:22,159 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] [2022-07-19 22:21:22,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:22,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1322109639, now seen corresponding path program 1 times [2022-07-19 22:21:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:22,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385883665] [2022-07-19 22:21:22,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:21:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:22,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:22,746 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-19 22:21:22,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:22,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385883665] [2022-07-19 22:21:22,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385883665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:22,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:22,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 22:21:22,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407559726] [2022-07-19 22:21:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:22,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:21:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:22,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:21:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 22:21:22,793 INFO L87 Difference]: Start difference. First operand has 1194 states, 856 states have (on average 1.3294392523364487) internal successors, (1138), 876 states have internal predecessors, (1138), 257 states have call successors, (257), 79 states have call predecessors, (257), 79 states have return successors, (257), 254 states have call predecessors, (257), 257 states have call successors, (257) Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 22:21:27,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:21:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:27,749 INFO L93 Difference]: Finished difference Result 3723 states and 5356 transitions. [2022-07-19 22:21:27,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:21:27,751 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-07-19 22:21:27,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:27,830 INFO L225 Difference]: With dead ends: 3723 [2022-07-19 22:21:27,832 INFO L226 Difference]: Without dead ends: 2511 [2022-07-19 22:21:27,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:21:27,850 INFO L413 NwaCegarLoop]: 1893 mSDtfsCounter, 2120 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 668 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2325 SdHoareTripleChecker+Valid, 3933 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 668 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:27,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2325 Valid, 3933 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [668 Valid, 1108 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-07-19 22:21:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2022-07-19 22:21:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2314. [2022-07-19 22:21:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 1660 states have (on average 1.3114457831325301) internal successors, (2177), 1693 states have internal predecessors, (2177), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-19 22:21:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3172 transitions. [2022-07-19 22:21:28,057 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3172 transitions. Word has length 23 [2022-07-19 22:21:28,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:28,058 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3172 transitions. [2022-07-19 22:21:28,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-19 22:21:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3172 transitions. [2022-07-19 22:21:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-19 22:21:28,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:28,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:28,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:21:28,074 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:28,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:28,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1781808508, now seen corresponding path program 1 times [2022-07-19 22:21:28,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:28,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469224184] [2022-07-19 22:21:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:28,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:21:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-19 22:21:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:21:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:21:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:21:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-19 22:21:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:21:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:21:28,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:21:28,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:21:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-19 22:21:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:21:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 22:21:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:21:28,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:21:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-19 22:21:28,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:28,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469224184] [2022-07-19 22:21:28,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469224184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:28,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:28,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:21:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010424880] [2022-07-19 22:21:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:28,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:21:28,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:28,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:21:28,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:21:28,458 INFO L87 Difference]: Start difference. First operand 2314 states and 3172 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-19 22:21:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:32,144 INFO L93 Difference]: Finished difference Result 4811 states and 6660 transitions. [2022-07-19 22:21:32,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:21:32,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2022-07-19 22:21:32,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:32,159 INFO L225 Difference]: With dead ends: 4811 [2022-07-19 22:21:32,159 INFO L226 Difference]: Without dead ends: 2546 [2022-07-19 22:21:32,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:21:32,168 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 925 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 3299 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 4795 SdHoareTripleChecker+Invalid, 3948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 3299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:32,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 4795 Invalid, 3948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 3299 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-19 22:21:32,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-07-19 22:21:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2314. [2022-07-19 22:21:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2314 states, 1660 states have (on average 1.310843373493976) internal successors, (2176), 1693 states have internal predecessors, (2176), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-19 22:21:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3171 transitions. [2022-07-19 22:21:32,263 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3171 transitions. Word has length 138 [2022-07-19 22:21:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:32,263 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3171 transitions. [2022-07-19 22:21:32,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-19 22:21:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3171 transitions. [2022-07-19 22:21:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-19 22:21:32,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:32,282 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:32,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:21:32,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -852391828, now seen corresponding path program 1 times [2022-07-19 22:21:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:32,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789071352] [2022-07-19 22:21:32,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:32,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:21:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-19 22:21:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:21:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:21:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-19 22:21:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:21:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:21:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:21:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:21:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:21:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:21:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:21:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:21:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:21:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:21:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:21:32,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:32,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789071352] [2022-07-19 22:21:32,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789071352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:32,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:32,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:21:32,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427707804] [2022-07-19 22:21:32,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:32,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:21:32,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:32,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:21:32,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:21:32,657 INFO L87 Difference]: Start difference. First operand 2314 states and 3171 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-19 22:21:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:35,319 INFO L93 Difference]: Finished difference Result 4913 states and 6821 transitions. [2022-07-19 22:21:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:21:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 145 [2022-07-19 22:21:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:35,334 INFO L225 Difference]: With dead ends: 4913 [2022-07-19 22:21:35,335 INFO L226 Difference]: Without dead ends: 2650 [2022-07-19 22:21:35,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:21:35,344 INFO L413 NwaCegarLoop]: 1532 mSDtfsCounter, 1369 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 1048 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 3450 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1048 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:35,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 3450 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1048 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-19 22:21:35,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-07-19 22:21:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2324. [2022-07-19 22:21:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.311377245508982) internal successors, (2190), 1703 states have internal predecessors, (2190), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-19 22:21:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3185 transitions. [2022-07-19 22:21:35,424 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3185 transitions. Word has length 145 [2022-07-19 22:21:35,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:35,425 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3185 transitions. [2022-07-19 22:21:35,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-19 22:21:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3185 transitions. [2022-07-19 22:21:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-19 22:21:35,429 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:35,429 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:35,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:21:35,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash 439921461, now seen corresponding path program 1 times [2022-07-19 22:21:35,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:35,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264043717] [2022-07-19 22:21:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:21:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 22:21:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-19 22:21:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-19 22:21:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 22:21:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:21:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:21:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-19 22:21:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 22:21:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:21:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-19 22:21:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-19 22:21:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:21:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-19 22:21:35,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:21:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:21:35,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:35,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264043717] [2022-07-19 22:21:35,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264043717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:35,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:35,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:21:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745205625] [2022-07-19 22:21:35,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:35,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:21:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:21:35,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:21:35,783 INFO L87 Difference]: Start difference. First operand 2324 states and 3185 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-19 22:21:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:39,290 INFO L93 Difference]: Finished difference Result 4833 states and 6690 transitions. [2022-07-19 22:21:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:21:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 142 [2022-07-19 22:21:39,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:39,329 INFO L225 Difference]: With dead ends: 4833 [2022-07-19 22:21:39,332 INFO L226 Difference]: Without dead ends: 2556 [2022-07-19 22:21:39,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:21:39,342 INFO L413 NwaCegarLoop]: 1528 mSDtfsCounter, 1256 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 3615 mSolverCounterSat, 969 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 4992 SdHoareTripleChecker+Invalid, 4584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 969 IncrementalHoareTripleChecker+Valid, 3615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:39,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 4992 Invalid, 4584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [969 Valid, 3615 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-19 22:21:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-19 22:21:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2324. [2022-07-19 22:21:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.3107784431137726) internal successors, (2189), 1702 states have internal predecessors, (2189), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-19 22:21:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3184 transitions. [2022-07-19 22:21:39,420 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3184 transitions. Word has length 142 [2022-07-19 22:21:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:39,420 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3184 transitions. [2022-07-19 22:21:39,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (20), 5 states have call predecessors, (20), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-19 22:21:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3184 transitions. [2022-07-19 22:21:39,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-19 22:21:39,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:39,425 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:39,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:21:39,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:39,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:39,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1210414124, now seen corresponding path program 1 times [2022-07-19 22:21:39,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:39,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615885845] [2022-07-19 22:21:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:21:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:21:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:21:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-19 22:21:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:21:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-19 22:21:39,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:21:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:21:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:21:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:21:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:21:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:21:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:21:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 22:21:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 22:21:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 22:21:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:21:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 22:21:39,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:39,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615885845] [2022-07-19 22:21:39,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615885845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:39,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:39,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:21:39,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318229568] [2022-07-19 22:21:39,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:39,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:21:39,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:39,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:21:39,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:21:39,731 INFO L87 Difference]: Start difference. First operand 2324 states and 3184 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-19 22:21:44,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:21:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:46,149 INFO L93 Difference]: Finished difference Result 4867 states and 6734 transitions. [2022-07-19 22:21:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:21:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 172 [2022-07-19 22:21:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:46,162 INFO L225 Difference]: With dead ends: 4867 [2022-07-19 22:21:46,162 INFO L226 Difference]: Without dead ends: 2556 [2022-07-19 22:21:46,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:21:46,169 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 936 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 5123 mSolverCounterSat, 662 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 6268 SdHoareTripleChecker+Invalid, 5786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 5123 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:46,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 6268 Invalid, 5786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 5123 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2022-07-19 22:21:46,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-19 22:21:46,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2324. [2022-07-19 22:21:46,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 1670 states have (on average 1.3101796407185629) internal successors, (2188), 1702 states have internal predecessors, (2188), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-19 22:21:46,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3183 transitions. [2022-07-19 22:21:46,240 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3183 transitions. Word has length 172 [2022-07-19 22:21:46,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:46,241 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3183 transitions. [2022-07-19 22:21:46,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 6 states have internal predecessors, (118), 3 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2022-07-19 22:21:46,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3183 transitions. [2022-07-19 22:21:46,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-19 22:21:46,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:46,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:46,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:21:46,245 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:46,246 INFO L85 PathProgramCache]: Analyzing trace with hash -848117149, now seen corresponding path program 1 times [2022-07-19 22:21:46,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:46,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963232536] [2022-07-19 22:21:46,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:46,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:21:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:21:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:21:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:21:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-19 22:21:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-19 22:21:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:21:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-19 22:21:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-19 22:21:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-19 22:21:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:21:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 22:21:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:21:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:21:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:21:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:21:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:21:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:46,534 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 22:21:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:46,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963232536] [2022-07-19 22:21:46,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963232536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:46,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:46,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:21:46,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195237729] [2022-07-19 22:21:46,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:46,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:21:46,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:46,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:21:46,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:21:46,536 INFO L87 Difference]: Start difference. First operand 2324 states and 3183 transitions. Second operand has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:21:50,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:21:52,915 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:21:55,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:21:57,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:57,338 INFO L93 Difference]: Finished difference Result 7831 states and 11495 transitions. [2022-07-19 22:21:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:21:57,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 174 [2022-07-19 22:21:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:57,366 INFO L225 Difference]: With dead ends: 7831 [2022-07-19 22:21:57,366 INFO L226 Difference]: Without dead ends: 5550 [2022-07-19 22:21:57,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:21:57,374 INFO L413 NwaCegarLoop]: 3010 mSDtfsCounter, 2713 mSDsluCounter, 7185 mSDsCounter, 0 mSdLazyCounter, 4850 mSolverCounterSat, 990 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3094 SdHoareTripleChecker+Valid, 10195 SdHoareTripleChecker+Invalid, 5843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 4850 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:57,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3094 Valid, 10195 Invalid, 5843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 4850 Invalid, 3 Unknown, 0 Unchecked, 10.6s Time] [2022-07-19 22:21:57,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2022-07-19 22:21:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 2326. [2022-07-19 22:21:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2326 states, 1672 states have (on average 1.3098086124401913) internal successors, (2190), 1704 states have internal predecessors, (2190), 497 states have call successors, (497), 157 states have call predecessors, (497), 156 states have return successors, (498), 489 states have call predecessors, (498), 495 states have call successors, (498) [2022-07-19 22:21:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3185 transitions. [2022-07-19 22:21:57,490 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3185 transitions. Word has length 174 [2022-07-19 22:21:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:57,491 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 3185 transitions. [2022-07-19 22:21:57,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.142857142857142) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-19 22:21:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3185 transitions. [2022-07-19 22:21:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-19 22:21:57,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:57,495 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:57,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 22:21:57,496 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:57,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:57,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1490806641, now seen corresponding path program 1 times [2022-07-19 22:21:57,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:57,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450609449] [2022-07-19 22:21:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:57,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:21:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:21:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:21:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 22:21:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-19 22:21:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-19 22:21:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:21:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:21:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:21:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:21:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-19 22:21:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:21:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:21:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:21:57,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:21:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:21:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:21:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 22:21:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 22:21:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:57,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450609449] [2022-07-19 22:21:57,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450609449] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:21:57,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196416310] [2022-07-19 22:21:57,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:57,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:57,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:21:57,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:21:57,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:21:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:58,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-19 22:21:58,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:21:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-19 22:21:58,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:21:58,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196416310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:58,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:21:58,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-19 22:21:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936697749] [2022-07-19 22:21:58,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:58,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:21:58,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:58,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:21:58,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:21:58,844 INFO L87 Difference]: Start difference. First operand 2326 states and 3185 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-19 22:21:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:21:59,013 INFO L93 Difference]: Finished difference Result 4637 states and 6351 transitions. [2022-07-19 22:21:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:21:59,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 179 [2022-07-19 22:21:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:21:59,023 INFO L225 Difference]: With dead ends: 4637 [2022-07-19 22:21:59,023 INFO L226 Difference]: Without dead ends: 2304 [2022-07-19 22:21:59,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:21:59,031 INFO L413 NwaCegarLoop]: 1620 mSDtfsCounter, 15 mSDsluCounter, 8072 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 9692 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:21:59,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 9692 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:21:59,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2022-07-19 22:21:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2022-07-19 22:21:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 1659 states have (on average 1.3092224231464737) internal successors, (2172), 1690 states have internal predecessors, (2172), 491 states have call successors, (491), 154 states have call predecessors, (491), 153 states have return successors, (492), 483 states have call predecessors, (492), 489 states have call successors, (492) [2022-07-19 22:21:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3155 transitions. [2022-07-19 22:21:59,125 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3155 transitions. Word has length 179 [2022-07-19 22:21:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:21:59,126 INFO L495 AbstractCegarLoop]: Abstraction has 2304 states and 3155 transitions. [2022-07-19 22:21:59,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 4 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-19 22:21:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3155 transitions. [2022-07-19 22:21:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-19 22:21:59,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:21:59,132 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:21:59,170 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-19 22:21:59,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:21:59,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:21:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:21:59,350 INFO L85 PathProgramCache]: Analyzing trace with hash 255731860, now seen corresponding path program 1 times [2022-07-19 22:21:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:21:59,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805894225] [2022-07-19 22:21:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:21:59,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:21:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:21:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:21:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:21:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:21:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 22:21:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:21:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:21:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-19 22:21:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-19 22:21:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-19 22:21:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:21:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 22:21:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:21:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:21:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:21:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:21:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 22:21:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:21:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 22:21:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-19 22:21:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:21:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 22:21:59,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:21:59,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805894225] [2022-07-19 22:21:59,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805894225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:21:59,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:21:59,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:21:59,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130582460] [2022-07-19 22:21:59,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:21:59,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:21:59,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:21:59,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:21:59,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:21:59,710 INFO L87 Difference]: Start difference. First operand 2304 states and 3155 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-19 22:22:02,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:22:02,035 INFO L93 Difference]: Finished difference Result 4861 states and 6721 transitions. [2022-07-19 22:22:02,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:22:02,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 198 [2022-07-19 22:22:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:22:02,049 INFO L225 Difference]: With dead ends: 4861 [2022-07-19 22:22:02,049 INFO L226 Difference]: Without dead ends: 2588 [2022-07-19 22:22:02,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:22:02,056 INFO L413 NwaCegarLoop]: 1539 mSDtfsCounter, 2461 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 1332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2599 SdHoareTripleChecker+Valid, 2685 SdHoareTripleChecker+Invalid, 2279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1332 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:22:02,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2599 Valid, 2685 Invalid, 2279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1332 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-19 22:22:02,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2022-07-19 22:22:02,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2339. [2022-07-19 22:22:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2339 states, 1682 states have (on average 1.302615933412604) internal successors, (2191), 1713 states have internal predecessors, (2191), 496 states have call successors, (496), 161 states have call predecessors, (496), 160 states have return successors, (497), 488 states have call predecessors, (497), 494 states have call successors, (497) [2022-07-19 22:22:02,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3184 transitions. [2022-07-19 22:22:02,201 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3184 transitions. Word has length 198 [2022-07-19 22:22:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:22:02,202 INFO L495 AbstractCegarLoop]: Abstraction has 2339 states and 3184 transitions. [2022-07-19 22:22:02,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 3 states have internal predecessors, (132), 3 states have call successors, (28), 6 states have call predecessors, (28), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-19 22:22:02,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3184 transitions. [2022-07-19 22:22:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-19 22:22:02,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:22:02,206 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:22:02,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:22:02,206 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:22:02,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:22:02,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1595536580, now seen corresponding path program 1 times [2022-07-19 22:22:02,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:22:02,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485284153] [2022-07-19 22:22:02,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:02,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:22:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:22:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:22:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:22:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 22:22:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:22:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:22:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:22:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:22:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-19 22:22:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-19 22:22:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-19 22:22:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-19 22:22:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-19 22:22:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:22:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-19 22:22:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-19 22:22:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:22:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 22:22:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 22:22:02,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:22:02,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485284153] [2022-07-19 22:22:02,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485284153] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:22:02,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568765996] [2022-07-19 22:22:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:02,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:22:02,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:22:02,640 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-19 22:22:02,649 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-19 22:22:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:03,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 22:22:03,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:22:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-19 22:22:03,482 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:22:03,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568765996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:22:03,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:22:03,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-19 22:22:03,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382001751] [2022-07-19 22:22:03,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:22:03,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:22:03,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:22:03,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:22:03,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:22:03,484 INFO L87 Difference]: Start difference. First operand 2339 states and 3184 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-19 22:22:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:22:03,690 INFO L93 Difference]: Finished difference Result 4625 states and 6318 transitions. [2022-07-19 22:22:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:22:03,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) Word has length 193 [2022-07-19 22:22:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:22:03,701 INFO L225 Difference]: With dead ends: 4625 [2022-07-19 22:22:03,701 INFO L226 Difference]: Without dead ends: 2349 [2022-07-19 22:22:03,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:22:03,708 INFO L413 NwaCegarLoop]: 1601 mSDtfsCounter, 15 mSDsluCounter, 6376 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 7977 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:22:03,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 7977 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:22:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-07-19 22:22:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2347. [2022-07-19 22:22:03,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2347 states, 1689 states have (on average 1.3013617525162817) internal successors, (2198), 1721 states have internal predecessors, (2198), 496 states have call successors, (496), 161 states have call predecessors, (496), 161 states have return successors, (499), 488 states have call predecessors, (499), 494 states have call successors, (499) [2022-07-19 22:22:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3193 transitions. [2022-07-19 22:22:03,817 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3193 transitions. Word has length 193 [2022-07-19 22:22:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:22:03,817 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3193 transitions. [2022-07-19 22:22:03,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (23), 3 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-19 22:22:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3193 transitions. [2022-07-19 22:22:03,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-19 22:22:03,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:22:03,821 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:22:03,854 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-19 22:22:04,040 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-19 22:22:04,040 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:22:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:22:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash -388855203, now seen corresponding path program 1 times [2022-07-19 22:22:04,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:22:04,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632694360] [2022-07-19 22:22:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:22:04,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:22:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:22:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-19 22:22:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-19 22:22:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-19 22:22:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-19 22:22:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:22:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:22:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:22:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:22:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:22:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-19 22:22:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 22:22:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:22:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 22:22:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-19 22:22:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 22:22:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 22:22:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 22:22:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-19 22:22:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:22:04,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632694360] [2022-07-19 22:22:04,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632694360] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:22:04,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120138909] [2022-07-19 22:22:04,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:04,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:22:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:22:04,423 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-19 22:22:04,424 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-19 22:22:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:05,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 3231 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-19 22:22:05,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:22:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 22:22:05,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:22:05,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120138909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:22:05,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:22:05,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 19 [2022-07-19 22:22:05,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455992414] [2022-07-19 22:22:05,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:22:05,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:22:05,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:22:05,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:22:05,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:22:05,487 INFO L87 Difference]: Start difference. First operand 2347 states and 3193 transitions. Second operand has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-19 22:22:05,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:22:05,938 INFO L93 Difference]: Finished difference Result 4685 states and 6403 transitions. [2022-07-19 22:22:05,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-19 22:22:05,939 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) Word has length 196 [2022-07-19 22:22:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:22:05,949 INFO L225 Difference]: With dead ends: 4685 [2022-07-19 22:22:05,949 INFO L226 Difference]: Without dead ends: 2373 [2022-07-19 22:22:05,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-07-19 22:22:05,957 INFO L413 NwaCegarLoop]: 1609 mSDtfsCounter, 65 mSDsluCounter, 14414 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 16023 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:22:05,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 16023 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:22:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2022-07-19 22:22:06,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2349. [2022-07-19 22:22:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2349 states, 1690 states have (on average 1.3011834319526627) internal successors, (2199), 1723 states have internal predecessors, (2199), 496 states have call successors, (496), 161 states have call predecessors, (496), 162 states have return successors, (500), 488 states have call predecessors, (500), 494 states have call successors, (500) [2022-07-19 22:22:06,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3195 transitions. [2022-07-19 22:22:06,069 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3195 transitions. Word has length 196 [2022-07-19 22:22:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:22:06,069 INFO L495 AbstractCegarLoop]: Abstraction has 2349 states and 3195 transitions. [2022-07-19 22:22:06,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.272727272727273) internal successors, (135), 7 states have internal predecessors, (135), 2 states have call successors, (28), 2 states have call predecessors, (28), 6 states have return successors, (24), 6 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-19 22:22:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3195 transitions. [2022-07-19 22:22:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-19 22:22:06,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:22:06,074 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:22:06,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-19 22:22:06,295 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-19 22:22:06,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:22:06,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:22:06,296 INFO L85 PathProgramCache]: Analyzing trace with hash 173882668, now seen corresponding path program 1 times [2022-07-19 22:22:06,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:22:06,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791143646] [2022-07-19 22:22:06,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:22:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:22:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-19 22:22:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-19 22:22:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:22:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-19 22:22:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-19 22:22:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-19 22:22:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-19 22:22:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:22:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:22:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:22:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-19 22:22:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-19 22:22:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:22:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-19 22:22:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:22:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 22:22:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-19 22:22:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-19 22:22:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-19 22:22:06,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:22:06,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791143646] [2022-07-19 22:22:06,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791143646] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:22:06,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754416576] [2022-07-19 22:22:06,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:06,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:22:06,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:22:06,658 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-19 22:22:06,689 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-19 22:22:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:07,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-19 22:22:07,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:22:07,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:07,525 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-19 22:22:07,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:07,534 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-19 22:22:07,594 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:22:07,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:22:07,883 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:22:07,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:22:08,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 22:22:08,795 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:22:08,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:22:08,955 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-19 22:22:08,965 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-19 22:22:09,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 22:22:09,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 22:22:09,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:09,863 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-19 22:22:09,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:09,871 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-19 22:22:10,528 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-19 22:22:10,535 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-19 22:22:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-19 22:22:10,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:22:11,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754416576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:22:11,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:22:11,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 32 [2022-07-19 22:22:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326914904] [2022-07-19 22:22:11,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:22:11,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-19 22:22:11,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:22:11,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-19 22:22:11,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1249, Unknown=5, NotChecked=0, Total=1406 [2022-07-19 22:22:11,873 INFO L87 Difference]: Start difference. First operand 2349 states and 3195 transitions. Second operand has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) [2022-07-19 22:22:19,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:21,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:23,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:25,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:27,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:30,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:32,673 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:34,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:36,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 22:22:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:22:40,370 INFO L93 Difference]: Finished difference Result 4936 states and 6774 transitions. [2022-07-19 22:22:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 22:22:40,370 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) Word has length 203 [2022-07-19 22:22:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:22:40,379 INFO L225 Difference]: With dead ends: 4936 [2022-07-19 22:22:40,380 INFO L226 Difference]: Without dead ends: 2590 [2022-07-19 22:22:40,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=320, Invalid=2431, Unknown=5, NotChecked=0, Total=2756 [2022-07-19 22:22:40,387 INFO L413 NwaCegarLoop]: 1522 mSDtfsCounter, 942 mSDsluCounter, 11744 mSDsCounter, 0 mSdLazyCounter, 11197 mSolverCounterSat, 667 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 13266 SdHoareTripleChecker+Invalid, 18420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 667 IncrementalHoareTripleChecker+Valid, 11197 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 6548 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:22:40,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 13266 Invalid, 18420 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [667 Valid, 11197 Invalid, 8 Unknown, 6548 Unchecked, 27.7s Time] [2022-07-19 22:22:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2022-07-19 22:22:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2358. [2022-07-19 22:22:40,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2358 states, 1697 states have (on average 1.299351797289334) internal successors, (2205), 1729 states have internal predecessors, (2205), 497 states have call successors, (497), 163 states have call predecessors, (497), 163 states have return successors, (500), 489 states have call predecessors, (500), 495 states have call successors, (500) [2022-07-19 22:22:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3202 transitions. [2022-07-19 22:22:40,494 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3202 transitions. Word has length 203 [2022-07-19 22:22:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:22:40,494 INFO L495 AbstractCegarLoop]: Abstraction has 2358 states and 3202 transitions. [2022-07-19 22:22:40,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 7.9375) internal successors, (254), 23 states have internal predecessors, (254), 9 states have call successors, (56), 11 states have call predecessors, (56), 13 states have return successors, (50), 13 states have call predecessors, (50), 8 states have call successors, (50) [2022-07-19 22:22:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3202 transitions. [2022-07-19 22:22:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-19 22:22:40,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:22:40,499 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:22:40,532 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-19 22:22:40,719 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-19 22:22:40,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:22:40,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:22:40,720 INFO L85 PathProgramCache]: Analyzing trace with hash 781303217, now seen corresponding path program 2 times [2022-07-19 22:22:40,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:22:40,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463970621] [2022-07-19 22:22:40,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:22:40,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:22:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:22:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:41,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:22:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:22:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:22:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:22:41,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:22:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:22:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:22:41,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:22:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:22:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:22:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 22:22:41,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-19 22:22:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:22:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 22:22:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 22:22:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 22:22:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-19 22:22:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 22:22:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 22:22:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-19 22:22:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:22:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-19 22:22:41,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:22:41,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463970621] [2022-07-19 22:22:41,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463970621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:22:41,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018675711] [2022-07-19 22:22:41,556 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:22:41,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:22:41,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:22:41,560 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-19 22:22:41,561 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-19 22:22:43,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 22:22:43,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:22:43,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-19 22:22:43,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:22:43,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:43,051 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-19 22:22:43,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:43,061 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-19 22:22:43,126 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:22:43,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:22:43,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 22:22:43,550 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:22:43,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:22:43,802 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 22:22:43,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-19 22:22:44,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 22:22:44,968 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-19 22:22:44,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-07-19 22:22:45,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-19 22:22:45,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-19 22:22:45,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-19 22:22:46,140 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-19 22:22:46,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-07-19 22:22:46,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:46,573 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-19 22:22:46,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:22:46,580 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-19 22:22:47,246 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-19 22:22:47,251 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-19 22:22:47,296 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 22:22:47,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:22:48,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018675711] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:22:48,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:22:48,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 26] total 38 [2022-07-19 22:22:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041080145] [2022-07-19 22:22:48,419 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:22:48,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-19 22:22:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:22:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-19 22:22:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1680, Unknown=9, NotChecked=0, Total=1892 [2022-07-19 22:22:48,421 INFO L87 Difference]: Start difference. First operand 2358 states and 3202 transitions. Second operand has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) [2022-07-19 22:23:01,077 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:03,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:05,218 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:07,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:09,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:11,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:13,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:15,598 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:17,665 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:19,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:22,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:24,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:26,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:28,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:30,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:23:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:37,904 INFO L93 Difference]: Finished difference Result 7358 states and 10175 transitions. [2022-07-19 22:23:37,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-19 22:23:37,907 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) Word has length 210 [2022-07-19 22:23:37,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:37,933 INFO L225 Difference]: With dead ends: 7358 [2022-07-19 22:23:37,933 INFO L226 Difference]: Without dead ends: 5066 [2022-07-19 22:23:37,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=459, Invalid=4362, Unknown=9, NotChecked=0, Total=4830 [2022-07-19 22:23:37,943 INFO L413 NwaCegarLoop]: 2914 mSDtfsCounter, 2584 mSDsluCounter, 29182 mSDsCounter, 0 mSdLazyCounter, 20538 mSolverCounterSat, 1494 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2825 SdHoareTripleChecker+Valid, 32096 SdHoareTripleChecker+Invalid, 42019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1494 IncrementalHoareTripleChecker+Valid, 20538 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 19973 IncrementalHoareTripleChecker+Unchecked, 47.8s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:37,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2825 Valid, 32096 Invalid, 42019 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1494 Valid, 20538 Invalid, 14 Unknown, 19973 Unchecked, 47.8s Time] [2022-07-19 22:23:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2022-07-19 22:23:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 4604. [2022-07-19 22:23:38,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4604 states, 3316 states have (on average 1.3027744270205066) internal successors, (4320), 3383 states have internal predecessors, (4320), 967 states have call successors, (967), 314 states have call predecessors, (967), 320 states have return successors, (999), 954 states have call predecessors, (999), 965 states have call successors, (999) [2022-07-19 22:23:38,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 6286 transitions. [2022-07-19 22:23:38,215 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 6286 transitions. Word has length 210 [2022-07-19 22:23:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:38,215 INFO L495 AbstractCegarLoop]: Abstraction has 4604 states and 6286 transitions. [2022-07-19 22:23:38,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 7.108108108108108) internal successors, (263), 28 states have internal predecessors, (263), 12 states have call successors, (57), 12 states have call predecessors, (57), 16 states have return successors, (51), 15 states have call predecessors, (51), 11 states have call successors, (51) [2022-07-19 22:23:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 6286 transitions. [2022-07-19 22:23:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-19 22:23:38,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:38,225 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:38,255 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-19 22:23:38,439 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-19 22:23:38,440 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1144769715, now seen corresponding path program 1 times [2022-07-19 22:23:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:38,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138664562] [2022-07-19 22:23:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:23:40,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:23:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:23:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:23:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:23:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:23:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:23:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:23:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:23:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:23:41,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:23:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 22:23:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-19 22:23:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:23:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-19 22:23:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-19 22:23:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-19 22:23:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-19 22:23:41,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-19 22:23:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-19 22:23:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-19 22:23:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-19 22:23:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:41,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138664562] [2022-07-19 22:23:41,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138664562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:41,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326716522] [2022-07-19 22:23:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:41,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:41,166 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-19 22:23:41,167 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-19 22:23:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:42,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-19 22:23:42,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:42,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:42,091 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-19 22:23:42,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:42,103 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-19 22:23:42,166 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:23:42,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:23:42,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 22:23:42,578 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:23:42,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:23:42,719 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:23:42,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:23:42,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 22:23:43,786 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:23:43,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:23:43,985 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-19 22:23:43,993 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-19 22:23:44,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 22:23:44,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 22:23:44,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:44,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, 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-19 22:23:44,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:44,607 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-19 22:23:44,906 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-19 22:23:44,908 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-19 22:23:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 22:23:44,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:23:45,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| Int) (v_ArrVal_838 Int) (v_ArrVal_839 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| Int) (v_ArrVal_841 (Array Int Int))) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_838))) (or (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21|)) (not (= (select .cse0 |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27|) 0)) (= (mod (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_841) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21| v_ArrVal_839) |c_~#pkt_devs~0.base|) |c_~#pkt_devs~0.offset|)) 18446744073709551616) 0) (not (= (select (store .cse0 |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_27| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_21|) 0))))) is different from false [2022-07-19 22:23:45,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326716522] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:45,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:23:45,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 43 [2022-07-19 22:23:45,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631030322] [2022-07-19 22:23:45,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:23:45,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-19 22:23:45,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:45,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-19 22:23:45,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1927, Unknown=1, NotChecked=90, Total=2256 [2022-07-19 22:23:45,706 INFO L87 Difference]: Start difference. First operand 4604 states and 6286 transitions. Second operand has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) [2022-07-19 22:24:00,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:02,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:04,305 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:06,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:08,451 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:11,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:13,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:15,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:17,619 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:19,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:24,668 INFO L93 Difference]: Finished difference Result 8430 states and 11667 transitions. [2022-07-19 22:24:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-19 22:24:24,669 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) Word has length 210 [2022-07-19 22:24:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:24,694 INFO L225 Difference]: With dead ends: 8430 [2022-07-19 22:24:24,694 INFO L226 Difference]: Without dead ends: 6131 [2022-07-19 22:24:24,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=973, Invalid=7772, Unknown=1, NotChecked=184, Total=8930 [2022-07-19 22:24:24,707 INFO L413 NwaCegarLoop]: 1470 mSDtfsCounter, 4866 mSDsluCounter, 10067 mSDsCounter, 0 mSdLazyCounter, 19332 mSolverCounterSat, 3104 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4943 SdHoareTripleChecker+Valid, 11537 SdHoareTripleChecker+Invalid, 26067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3104 IncrementalHoareTripleChecker+Valid, 19332 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 3621 IncrementalHoareTripleChecker+Unchecked, 36.7s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:24,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4943 Valid, 11537 Invalid, 26067 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3104 Valid, 19332 Invalid, 10 Unknown, 3621 Unchecked, 36.7s Time] [2022-07-19 22:24:24,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2022-07-19 22:24:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 5348. [2022-07-19 22:24:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5348 states, 3863 states have (on average 1.309086202433342) internal successors, (5057), 3945 states have internal predecessors, (5057), 1096 states have call successors, (1096), 379 states have call predecessors, (1096), 388 states have return successors, (1130), 1072 states have call predecessors, (1130), 1094 states have call successors, (1130) [2022-07-19 22:24:25,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7283 transitions. [2022-07-19 22:24:25,014 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7283 transitions. Word has length 210 [2022-07-19 22:24:25,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:25,015 INFO L495 AbstractCegarLoop]: Abstraction has 5348 states and 7283 transitions. [2022-07-19 22:24:25,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 6.119047619047619) internal successors, (257), 32 states have internal predecessors, (257), 15 states have call successors, (57), 10 states have call predecessors, (57), 16 states have return successors, (51), 21 states have call predecessors, (51), 13 states have call successors, (51) [2022-07-19 22:24:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7283 transitions. [2022-07-19 22:24:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-19 22:24:25,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:25,025 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:24:25,059 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-19 22:24:25,247 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-19 22:24:25,248 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:25,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1868991143, now seen corresponding path program 1 times [2022-07-19 22:24:25,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:25,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769943446] [2022-07-19 22:24:25,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:25,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:25,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:24:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:24:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:24:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:24:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:24:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:24:25,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:24:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:24:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:24:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 22:24:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-19 22:24:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:24:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-19 22:24:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 22:24:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-19 22:24:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 22:24:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-19 22:24:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-19 22:24:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-19 22:24:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 22:24:25,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:25,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769943446] [2022-07-19 22:24:25,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769943446] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:25,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392702589] [2022-07-19 22:24:25,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:25,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:25,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:25,565 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-19 22:24:25,593 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-19 22:24:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:26,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 22:24:26,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-19 22:24:26,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:24:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 22:24:26,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392702589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:24:26,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:24:26,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-19 22:24:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640758222] [2022-07-19 22:24:26,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:24:26,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:24:26,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:24:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:24:26,432 INFO L87 Difference]: Start difference. First operand 5348 states and 7283 transitions. Second operand has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-19 22:24:31,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:34,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:24:35,970 INFO L93 Difference]: Finished difference Result 11457 states and 15862 transitions. [2022-07-19 22:24:35,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:24:35,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 211 [2022-07-19 22:24:35,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:24:35,994 INFO L225 Difference]: With dead ends: 11457 [2022-07-19 22:24:35,994 INFO L226 Difference]: Without dead ends: 6702 [2022-07-19 22:24:36,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 469 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:24:36,007 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 1280 mSDsluCounter, 5519 mSDsCounter, 0 mSdLazyCounter, 6238 mSolverCounterSat, 881 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 7072 SdHoareTripleChecker+Invalid, 7121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 6238 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:24:36,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 7072 Invalid, 7121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 6238 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2022-07-19 22:24:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2022-07-19 22:24:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 5409. [2022-07-19 22:24:36,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5409 states, 3924 states have (on average 1.3093781855249744) internal successors, (5138), 4006 states have internal predecessors, (5138), 1096 states have call successors, (1096), 379 states have call predecessors, (1096), 388 states have return successors, (1130), 1072 states have call predecessors, (1130), 1094 states have call successors, (1130) [2022-07-19 22:24:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7364 transitions. [2022-07-19 22:24:36,317 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7364 transitions. Word has length 211 [2022-07-19 22:24:36,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:24:36,318 INFO L495 AbstractCegarLoop]: Abstraction has 5409 states and 7364 transitions. [2022-07-19 22:24:36,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.1) internal successors, (171), 7 states have internal predecessors, (171), 2 states have call successors, (49), 5 states have call predecessors, (49), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-19 22:24:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7364 transitions. [2022-07-19 22:24:36,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-19 22:24:36,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:24:36,327 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:24:36,362 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-19 22:24:36,551 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-19 22:24:36,552 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:24:36,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:24:36,552 INFO L85 PathProgramCache]: Analyzing trace with hash -946143103, now seen corresponding path program 1 times [2022-07-19 22:24:36,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:24:36,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604555173] [2022-07-19 22:24:36,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:36,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:24:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:37,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:24:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:37,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-19 22:24:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:24:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 22:24:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:24:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-19 22:24:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-19 22:24:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:24:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-19 22:24:38,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-19 22:24:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:24:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-19 22:24:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:24:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-19 22:24:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-19 22:24:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:24:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 22:24:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 22:24:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-19 22:24:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-19 22:24:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-19 22:24:38,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-19 22:24:38,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:24:38,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604555173] [2022-07-19 22:24:38,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604555173] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:38,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681281471] [2022-07-19 22:24:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:24:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:24:38,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:24:38,606 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-19 22:24:38,607 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-19 22:24:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:24:39,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 3311 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-19 22:24:39,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:24:39,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:39,451 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 16 treesize of output 18 [2022-07-19 22:24:39,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:39,459 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 25 treesize of output 25 [2022-07-19 22:24:39,541 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:24:39,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:24:39,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 22:24:40,030 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:24:40,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:24:40,167 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:24:40,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:24:40,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 12 treesize of output 9 [2022-07-19 22:24:41,561 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-19 22:24:41,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-19 22:24:41,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:41,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2022-07-19 22:24:41,813 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 16 treesize of output 18 [2022-07-19 22:24:42,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 22:24:42,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-19 22:24:43,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:43,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:43,225 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 22:24:43,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 35 [2022-07-19 22:24:43,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:24:43,234 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 16 treesize of output 18 [2022-07-19 22:24:43,249 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:24:43,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-19 22:24:44,011 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-19 22:24:44,020 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 22:24:44,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 17 [2022-07-19 22:24:44,027 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 25 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-19 22:24:44,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:24:44,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array Int Int)) (|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| Int) (v_ArrVal_1081 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| Int)) (or (not (= (select (store |c_#valid| |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|) 0)) (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|)) (= (mod (let ((.cse0 (+ |c_~#pkt_devs~0.offset| 8))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1082) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1081) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2022-07-19 22:24:44,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1082 (Array Int Int)) (|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| Int) (v_ArrVal_1081 (Array Int Int)) (v_ArrVal_1078 Int) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| Int)) (or (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1078) |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_28| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|) 0)) (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22|)) (= (mod (let ((.cse0 (+ |c_~#pkt_devs~0.offset| 8))) (+ (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1082) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_22| v_ArrVal_1081) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2022-07-19 22:24:44,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681281471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:24:44,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:24:44,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2022-07-19 22:24:44,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403717187] [2022-07-19 22:24:44,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 22:24:44,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-19 22:24:44,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:24:44,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-19 22:24:44,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2687, Unknown=2, NotChecked=214, Total=3192 [2022-07-19 22:24:44,639 INFO L87 Difference]: Start difference. First operand 5409 states and 7364 transitions. Second operand has 51 states, 49 states have (on average 5.469387755102041) internal successors, (268), 40 states have internal predecessors, (268), 19 states have call successors, (58), 12 states have call predecessors, (58), 17 states have return successors, (52), 23 states have call predecessors, (52), 17 states have call successors, (52) [2022-07-19 22:24:49,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:51,803 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:53,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:56,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-19 22:24:58,103 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []