./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 f4b24e32 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-?-f4b24e3 [2022-07-13 22:59:12,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:59:12,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:59:12,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:59:12,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:59:12,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:59:12,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:59:12,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:59:12,529 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:59:12,530 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:59:12,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:59:12,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:59:12,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:59:12,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:59:12,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:59:12,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:59:12,534 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:59:12,535 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:59:12,536 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:59:12,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:59:12,539 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:59:12,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:59:12,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:59:12,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:59:12,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:59:12,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:59:12,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:59:12,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:59:12,545 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:59:12,545 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:59:12,546 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:59:12,546 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:59:12,547 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:59:12,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:59:12,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:59:12,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:59:12,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:59:12,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:59:12,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:59:12,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:59:12,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:59:12,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:59:12,569 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:59:12,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:59:12,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:59:12,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:59:12,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:59:12,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:59:12,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:59:12,588 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:59:12,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:59:12,588 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:59:12,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:59:12,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:59:12,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:59:12,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:59:12,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:59:12,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:59:12,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:59:12,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:59:12,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:59:12,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:59:12,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:59:12,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:59:12,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:59:12,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:59:12,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:59:12,592 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:59:12,592 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:59:12,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:59:12,592 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:59:12,593 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:59:12,593 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:59:12,593 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-13 22:59:12,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:59:12,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:59:12,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:59:12,811 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:59:12,811 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:59:12,812 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-13 22:59:12,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03219d73/2e650d77f47f449da7f6884704ee8923/FLAG167a4c099 [2022-07-13 22:59:13,419 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:59:13,419 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-13 22:59:13,457 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03219d73/2e650d77f47f449da7f6884704ee8923/FLAG167a4c099 [2022-07-13 22:59:13,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c03219d73/2e650d77f47f449da7f6884704ee8923 [2022-07-13 22:59:13,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:59:13,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:59:13,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:59:13,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:59:13,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:59:13,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:59:13" (1/1) ... [2022-07-13 22:59:13,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b7e8806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:13, skipping insertion in model container [2022-07-13 22:59:13,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:59:13" (1/1) ... [2022-07-13 22:59:13,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:59:13,692 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:59:14,928 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-13 22:59:14,968 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:59:14,983 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:59:15,250 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-13 22:59:15,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:59:15,339 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:59:15,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15 WrapperNode [2022-07-13 22:59:15,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:59:15,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:59:15,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:59:15,341 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:59:15,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,541 INFO L137 Inliner]: procedures = 309, calls = 2432, calls flagged for inlining = 139, calls inlined = 90, statements flattened = 3953 [2022-07-13 22:59:15,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:59:15,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:59:15,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:59:15,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:59:15,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:59:15,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:59:15,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:59:15,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:59:15,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (1/1) ... [2022-07-13 22:59:15,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:59:15,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:59:15,754 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-13 22:59:15,775 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-13 22:59:15,793 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-13 22:59:15,794 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-13 22:59:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-13 22:59:15,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-13 22:59:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_ctl_ioctl [2022-07-13 22:59:15,794 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_ctl_ioctl [2022-07-13 22:59:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_release [2022-07-13 22:59:15,794 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_release [2022-07-13 22:59:15,794 INFO L130 BoogieDeclarations]: Found specification of procedure bdev_get_queue [2022-07-13 22:59:15,795 INFO L138 BoogieDeclarations]: Found implementation of procedure bdev_get_queue [2022-07-13 22:59:15,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 22:59:15,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 22:59:15,795 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_disc_info [2022-07-13 22:59:15,795 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_disc_info [2022-07-13 22:59:15,795 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_bio_alloc [2022-07-13 22:59:15,795 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_bio_alloc [2022-07-13 22:59:15,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 22:59:15,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 22:59:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_setup_dev [2022-07-13 22:59:15,796 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_setup_dev [2022-07-13 22:59:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2022-07-13 22:59:15,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2022-07-13 22:59:15,796 INFO L130 BoogieDeclarations]: Found specification of procedure bdget [2022-07-13 22:59:15,796 INFO L138 BoogieDeclarations]: Found implementation of procedure bdget [2022-07-13 22:59:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_set_speed [2022-07-13 22:59:15,797 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_set_speed [2022-07-13 22:59:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure bdevname [2022-07-13 22:59:15,797 INFO L138 BoogieDeclarations]: Found implementation of procedure bdevname [2022-07-13 22:59:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2022-07-13 22:59:15,797 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2022-07-13 22:59:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_shrink_pktlist [2022-07-13 22:59:15,797 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_shrink_pktlist [2022-07-13 22:59:15,797 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-13 22:59:15,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-13 22:59:15,798 INFO L130 BoogieDeclarations]: Found specification of procedure set_capacity [2022-07-13 22:59:15,798 INFO L138 BoogieDeclarations]: Found implementation of procedure set_capacity [2022-07-13 22:59:15,798 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-13 22:59:15,798 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-13 22:59:15,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 22:59:15,798 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 22:59:15,799 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_put [2022-07-13 22:59:15,799 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_put [2022-07-13 22:59:15,799 INFO L130 BoogieDeclarations]: Found specification of procedure new_encode_dev [2022-07-13 22:59:15,799 INFO L138 BoogieDeclarations]: Found implementation of procedure new_encode_dev [2022-07-13 22:59:15,799 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-13 22:59:15,799 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-13 22:59:15,799 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_select [2022-07-13 22:59:15,800 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_select [2022-07-13 22:59:15,800 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_remove [2022-07-13 22:59:15,800 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_remove [2022-07-13 22:59:15,800 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2022-07-13 22:59:15,800 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2022-07-13 22:59:15,800 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_debugfs_cleanup [2022-07-13 22:59:15,800 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_debugfs_cleanup [2022-07-13 22:59:15,801 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:59:15,801 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-13 22:59:15,801 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-13 22:59:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure bio_init [2022-07-13 22:59:15,802 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_init [2022-07-13 22:59:15,802 INFO L130 BoogieDeclarations]: Found specification of procedure set_blocksize [2022-07-13 22:59:15,803 INFO L138 BoogieDeclarations]: Found implementation of procedure set_blocksize [2022-07-13 22:59:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_dump_sense [2022-07-13 22:59:15,803 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_dump_sense [2022-07-13 22:59:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_create_kmalloc_pool [2022-07-13 22:59:15,803 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_create_kmalloc_pool [2022-07-13 22:59:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure mempool_destroy [2022-07-13 22:59:15,803 INFO L138 BoogieDeclarations]: Found implementation of procedure mempool_destroy [2022-07-13 22:59:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:59:15,803 INFO L130 BoogieDeclarations]: Found specification of procedure remove_proc_entry [2022-07-13 22:59:15,804 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_proc_entry [2022-07-13 22:59:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_lock_door [2022-07-13 22:59:15,804 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_lock_door [2022-07-13 22:59:15,804 INFO L130 BoogieDeclarations]: Found specification of procedure blkdev_get [2022-07-13 22:59:15,804 INFO L138 BoogieDeclarations]: Found implementation of procedure blkdev_get [2022-07-13 22:59:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_remove_dev [2022-07-13 22:59:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_remove_dev [2022-07-13 22:59:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure __free_pages [2022-07-13 22:59:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __free_pages [2022-07-13 22:59:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-13 22:59:15,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-13 22:59:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:59:15,805 INFO L130 BoogieDeclarations]: Found specification of procedure bio_put [2022-07-13 22:59:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_put [2022-07-13 22:59:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:59:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-13 22:59:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-13 22:59:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure capable [2022-07-13 22:59:15,806 INFO L138 BoogieDeclarations]: Found implementation of procedure capable [2022-07-13 22:59:15,806 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_remove [2022-07-13 22:59:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_remove [2022-07-13 22:59:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure debugfs_create_dir [2022-07-13 22:59:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure debugfs_create_dir [2022-07-13 22:59:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-13 22:59:15,807 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-13 22:59:15,807 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-13 22:59:15,808 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-13 22:59:15,808 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-13 22:59:15,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-13 22:59:15,808 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2022-07-13 22:59:15,809 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2022-07-13 22:59:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-07-13 22:59:15,809 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-07-13 22:59:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_sysfs_cleanup [2022-07-13 22:59:15,809 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_sysfs_cleanup [2022-07-13 22:59:15,809 INFO L130 BoogieDeclarations]: Found specification of procedure bio_list_init [2022-07-13 22:59:15,809 INFO L138 BoogieDeclarations]: Found implementation of procedure bio_list_init [2022-07-13 22:59:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_find_dev_from_minor [2022-07-13 22:59:15,810 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_find_dev_from_minor [2022-07-13 22:59:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 22:59:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-13 22:59:15,810 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-13 22:59:15,810 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-13 22:59:15,811 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-13 22:59:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-13 22:59:15,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-07-13 22:59:15,811 INFO L130 BoogieDeclarations]: Found specification of procedure init_write_congestion_marks [2022-07-13 22:59:15,811 INFO L138 BoogieDeclarations]: Found implementation of procedure init_write_congestion_marks [2022-07-13 22:59:15,812 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-13 22:59:15,812 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-13 22:59:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 22:59:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_get_track_info [2022-07-13 22:59:15,814 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_get_track_info [2022-07-13 22:59:15,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 22:59:15,815 INFO L130 BoogieDeclarations]: Found specification of procedure single_open [2022-07-13 22:59:15,816 INFO L138 BoogieDeclarations]: Found implementation of procedure single_open [2022-07-13 22:59:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-13 22:59:15,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-13 22:59:15,816 INFO L130 BoogieDeclarations]: Found specification of procedure new_decode_dev [2022-07-13 22:59:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure new_decode_dev [2022-07-13 22:59:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-07-13 22:59:15,820 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-07-13 22:59:15,820 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_kobj_create [2022-07-13 22:59:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_kobj_create [2022-07-13 22:59:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-13 22:59:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-13 22:59:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_blkdev [2022-07-13 22:59:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_blkdev [2022-07-13 22:59:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 22:59:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:59:15,821 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2022-07-13 22:59:15,821 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2022-07-13 22:59:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:59:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_put [2022-07-13 22:59:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_put [2022-07-13 22:59:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:59:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure blk_cleanup_queue [2022-07-13 22:59:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_cleanup_queue [2022-07-13 22:59:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure queue_max_segments [2022-07-13 22:59:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_max_segments [2022-07-13 22:59:15,822 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_check_events [2022-07-13 22:59:15,822 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_check_events [2022-07-13 22:59:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure init_cdrom_command [2022-07-13 22:59:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure init_cdrom_command [2022-07-13 22:59:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2022-07-13 22:59:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2022-07-13 22:59:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_mode_sense [2022-07-13 22:59:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_mode_sense [2022-07-13 22:59:15,823 INFO L130 BoogieDeclarations]: Found specification of procedure put_disk [2022-07-13 22:59:15,823 INFO L138 BoogieDeclarations]: Found implementation of procedure put_disk [2022-07-13 22:59:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_generic_packet [2022-07-13 22:59:15,824 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_generic_packet [2022-07-13 22:59:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-07-13 22:59:15,824 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-07-13 22:59:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-07-13 22:59:15,824 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-07-13 22:59:15,824 INFO L130 BoogieDeclarations]: Found specification of procedure blk_queue_max_hw_sectors [2022-07-13 22:59:15,824 INFO L138 BoogieDeclarations]: Found implementation of procedure blk_queue_max_hw_sectors [2022-07-13 22:59:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure pkt_flush_cache [2022-07-13 22:59:15,825 INFO L138 BoogieDeclarations]: Found implementation of procedure pkt_flush_cache [2022-07-13 22:59:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:59:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:59:15,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:59:15,825 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-13 22:59:15,825 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-13 22:59:16,289 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:59:16,292 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:59:16,494 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:16,614 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-07-13 22:59:16,614 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-07-13 22:59:17,481 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:17,486 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:17,487 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:17,489 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:17,491 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:17,492 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:17,495 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 22:59:22,855 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##416: assume false; [2022-07-13 22:59:22,855 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##417: assume !false; [2022-07-13 22:59:22,855 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##282: assume !false; [2022-07-13 22:59:22,855 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##281: assume false; [2022-07-13 22:59:22,855 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##214: assume !false; [2022-07-13 22:59:22,856 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##213: assume false; [2022-07-13 22:59:22,856 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##324: assume false; [2022-07-13 22:59:22,856 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##177: assume !false; [2022-07-13 22:59:22,856 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##176: assume false; [2022-07-13 22:59:22,856 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !false; [2022-07-13 22:59:22,856 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume false; [2022-07-13 22:59:22,856 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##153: assume !false; [2022-07-13 22:59:22,856 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##152: assume false; [2022-07-13 22:59:22,857 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##325: assume !false; [2022-07-13 22:59:22,880 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:59:22,890 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:59:22,890 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 22:59:22,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:59:22 BoogieIcfgContainer [2022-07-13 22:59:22,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:59:22,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:59:22,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:59:22,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:59:22,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:59:13" (1/3) ... [2022-07-13 22:59:22,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4602dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:59:22, skipping insertion in model container [2022-07-13 22:59:22,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:59:15" (2/3) ... [2022-07-13 22:59:22,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4602dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:59:22, skipping insertion in model container [2022-07-13 22:59:22,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:59:22" (3/3) ... [2022-07-13 22:59:22,899 INFO L111 eAbstractionObserver]: Analyzing ICFG module_get_put-drivers-block-pktcdvd.ko.cil.out.i [2022-07-13 22:59:22,910 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:59:22,910 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:59:22,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:59:23,002 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@6b0fad7c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bdf19c5 [2022-07-13 22:59:23,003 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:59:23,009 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-13 22:59:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 22:59:23,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:23,016 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-13 22:59:23,016 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:23,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:23,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1322109639, now seen corresponding path program 1 times [2022-07-13 22:59:23,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:23,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972543379] [2022-07-13 22:59:23,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:23,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:23,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:59:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:23,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:23,493 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-13 22:59:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:23,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972543379] [2022-07-13 22:59:23,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972543379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:23,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:23,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 22:59:23,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920899647] [2022-07-13 22:59:23,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:23,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:59:23,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:23,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:59:23,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 22:59:23,528 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-13 22:59:26,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:26,317 INFO L93 Difference]: Finished difference Result 3723 states and 5356 transitions. [2022-07-13 22:59:26,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:59:26,319 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-13 22:59:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:26,346 INFO L225 Difference]: With dead ends: 3723 [2022-07-13 22:59:26,346 INFO L226 Difference]: Without dead ends: 2511 [2022-07-13 22:59:26,363 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-13 22:59:26,365 INFO L413 NwaCegarLoop]: 1884 mSDtfsCounter, 2128 mSDsluCounter, 2036 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2329 SdHoareTripleChecker+Valid, 3920 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:26,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2329 Valid, 3920 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-13 22:59:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2022-07-13 22:59:26,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 2314. [2022-07-13 22:59:26,504 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-13 22:59:26,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3172 transitions. [2022-07-13 22:59:26,517 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3172 transitions. Word has length 23 [2022-07-13 22:59:26,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:26,518 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3172 transitions. [2022-07-13 22:59:26,518 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-13 22:59:26,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3172 transitions. [2022-07-13 22:59:26,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-13 22:59:26,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:26,526 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-13 22:59:26,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:59:26,527 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:26,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1781808508, now seen corresponding path program 1 times [2022-07-13 22:59:26,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:26,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658121689] [2022-07-13 22:59:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:26,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:59:26,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:59:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-13 22:59:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:59:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:59:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:59:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:59:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:59:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:59:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:59:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:59:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:59:26,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:59:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 22:59:26,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:59:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:26,877 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-13 22:59:26,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:26,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658121689] [2022-07-13 22:59:26,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658121689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:26,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:26,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:59:26,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629230341] [2022-07-13 22:59:26,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:26,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:59:26,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:26,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:59:26,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:59:26,880 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-13 22:59:30,941 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-13 22:59:33,012 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-13 22:59:34,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:34,560 INFO L93 Difference]: Finished difference Result 4811 states and 6660 transitions. [2022-07-13 22:59:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:59:34,561 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-13 22:59:34,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:34,572 INFO L225 Difference]: With dead ends: 4811 [2022-07-13 22:59:34,573 INFO L226 Difference]: Without dead ends: 2546 [2022-07-13 22:59:34,580 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-13 22:59:34,581 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 925 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 3292 mSolverCounterSat, 649 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 4795 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 3292 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:34,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 4795 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 3292 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-07-13 22:59:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2022-07-13 22:59:34,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2314. [2022-07-13 22:59:34,635 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-13 22:59:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 3171 transitions. [2022-07-13 22:59:34,645 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 3171 transitions. Word has length 138 [2022-07-13 22:59:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:34,645 INFO L495 AbstractCegarLoop]: Abstraction has 2314 states and 3171 transitions. [2022-07-13 22:59:34,646 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-13 22:59:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 3171 transitions. [2022-07-13 22:59:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-13 22:59:34,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:34,654 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-13 22:59:34,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 22:59:34,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:34,655 INFO L85 PathProgramCache]: Analyzing trace with hash -852391828, now seen corresponding path program 1 times [2022-07-13 22:59:34,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:34,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122392510] [2022-07-13 22:59:34,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:34,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:59:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-13 22:59:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:59:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 22:59:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:59:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:59:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:59:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:59:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:59:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 22:59:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:59:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:59:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:59:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:59:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 22:59:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:34,979 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-13 22:59:34,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:34,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122392510] [2022-07-13 22:59:34,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122392510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:34,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:34,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 22:59:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618982797] [2022-07-13 22:59:34,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:34,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 22:59:34,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:34,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 22:59:34,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:59:34,983 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-13 22:59:37,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:37,344 INFO L93 Difference]: Finished difference Result 4913 states and 6821 transitions. [2022-07-13 22:59:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:59:37,345 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-13 22:59:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:37,355 INFO L225 Difference]: With dead ends: 4913 [2022-07-13 22:59:37,355 INFO L226 Difference]: Without dead ends: 2650 [2022-07-13 22:59:37,360 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-13 22:59:37,363 INFO L413 NwaCegarLoop]: 1560 mSDtfsCounter, 1351 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 1036 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1036 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:37,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 3478 Invalid, 2876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1036 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-13 22:59:37,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2022-07-13 22:59:37,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2324. [2022-07-13 22:59:37,422 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-13 22:59:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3185 transitions. [2022-07-13 22:59:37,431 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3185 transitions. Word has length 145 [2022-07-13 22:59:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:37,431 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3185 transitions. [2022-07-13 22:59:37,431 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-13 22:59:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3185 transitions. [2022-07-13 22:59:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 22:59:37,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:37,434 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-13 22:59:37,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 22:59:37,435 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:37,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:37,436 INFO L85 PathProgramCache]: Analyzing trace with hash 439921461, now seen corresponding path program 1 times [2022-07-13 22:59:37,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:37,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042656263] [2022-07-13 22:59:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:37,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:59:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:59:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 22:59:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:59:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:59:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:59:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:59:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:59:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-13 22:59:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:59:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:59:37,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:59:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:59:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:59:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:59:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:37,673 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-13 22:59:37,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:37,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042656263] [2022-07-13 22:59:37,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042656263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:37,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:37,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 22:59:37,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913362160] [2022-07-13 22:59:37,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:37,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:59:37,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:59:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:59:37,678 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-13 22:59:41,858 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-13 22:59:43,923 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-13 22:59:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:45,030 INFO L93 Difference]: Finished difference Result 4833 states and 6690 transitions. [2022-07-13 22:59:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:59:45,031 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-13 22:59:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:45,041 INFO L225 Difference]: With dead ends: 4833 [2022-07-13 22:59:45,042 INFO L226 Difference]: Without dead ends: 2556 [2022-07-13 22:59:45,049 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-13 22:59:45,051 INFO L413 NwaCegarLoop]: 1523 mSDtfsCounter, 1257 mSDsluCounter, 3464 mSDsCounter, 0 mSdLazyCounter, 3596 mSolverCounterSat, 969 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1352 SdHoareTripleChecker+Valid, 4987 SdHoareTripleChecker+Invalid, 4567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 969 IncrementalHoareTripleChecker+Valid, 3596 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:45,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1352 Valid, 4987 Invalid, 4567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [969 Valid, 3596 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-13 22:59:45,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-13 22:59:45,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2324. [2022-07-13 22:59:45,109 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-13 22:59:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3184 transitions. [2022-07-13 22:59:45,117 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3184 transitions. Word has length 142 [2022-07-13 22:59:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:45,117 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3184 transitions. [2022-07-13 22:59:45,117 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-13 22:59:45,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3184 transitions. [2022-07-13 22:59:45,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-13 22:59:45,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:45,120 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-13 22:59:45,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 22:59:45,121 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:45,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:45,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1210414124, now seen corresponding path program 1 times [2022-07-13 22:59:45,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:45,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99682032] [2022-07-13 22:59:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:59:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:59:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 22:59:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:59:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:59:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:59:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 22:59:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:59:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:59:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:59:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 22:59:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:59:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 22:59:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-13 22:59:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 22:59:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 22:59:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 22:59:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:45,379 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-13 22:59:45,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:45,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99682032] [2022-07-13 22:59:45,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99682032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:45,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:45,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:59:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85957366] [2022-07-13 22:59:45,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:45,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:59:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:59:45,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:59:45,381 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-13 22:59:50,016 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-13 22:59:51,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:59:51,445 INFO L93 Difference]: Finished difference Result 4867 states and 6734 transitions. [2022-07-13 22:59:51,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:59:51,446 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-13 22:59:51,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:59:51,459 INFO L225 Difference]: With dead ends: 4867 [2022-07-13 22:59:51,459 INFO L226 Difference]: Without dead ends: 2556 [2022-07-13 22:59:51,466 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-13 22:59:51,467 INFO L413 NwaCegarLoop]: 1519 mSDtfsCounter, 937 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 5126 mSolverCounterSat, 663 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 6269 SdHoareTripleChecker+Invalid, 5790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 5126 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-07-13 22:59:51,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 6269 Invalid, 5790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 5126 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2022-07-13 22:59:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-13 22:59:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2324. [2022-07-13 22:59:51,539 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-13 22:59:51,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3183 transitions. [2022-07-13 22:59:51,548 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3183 transitions. Word has length 172 [2022-07-13 22:59:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:59:51,549 INFO L495 AbstractCegarLoop]: Abstraction has 2324 states and 3183 transitions. [2022-07-13 22:59:51,549 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-13 22:59:51,550 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3183 transitions. [2022-07-13 22:59:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-07-13 22:59:51,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:59:51,553 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-13 22:59:51,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 22:59:51,554 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:59:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:59:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash -848117149, now seen corresponding path program 1 times [2022-07-13 22:59:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:59:51,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357683891] [2022-07-13 22:59:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:59:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:59:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 22:59:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:59:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:59:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 22:59:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:59:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:59:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:59:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-13 22:59:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-13 22:59:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-13 22:59:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 22:59:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:59:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 22:59:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 22:59:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-13 22:59:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 22:59:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 22:59:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 22:59:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:59:51,825 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-13 22:59:51,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:59:51,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357683891] [2022-07-13 22:59:51,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357683891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:59:51,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:59:51,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 22:59:51,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322125530] [2022-07-13 22:59:51,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:59:51,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:59:51,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:59:51,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:59:51,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:59:51,828 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-13 22:59:55,935 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-13 22:59:58,321 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-13 23:00:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:00:00,274 INFO L93 Difference]: Finished difference Result 7831 states and 11495 transitions. [2022-07-13 23:00:00,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:00:00,279 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-13 23:00:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:00:00,300 INFO L225 Difference]: With dead ends: 7831 [2022-07-13 23:00:00,301 INFO L226 Difference]: Without dead ends: 5550 [2022-07-13 23:00:00,306 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-13 23:00:00,307 INFO L413 NwaCegarLoop]: 2971 mSDtfsCounter, 2738 mSDsluCounter, 7058 mSDsCounter, 0 mSdLazyCounter, 4845 mSolverCounterSat, 986 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3124 SdHoareTripleChecker+Valid, 10029 SdHoareTripleChecker+Invalid, 5833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 986 IncrementalHoareTripleChecker+Valid, 4845 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:00:00,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3124 Valid, 10029 Invalid, 5833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [986 Valid, 4845 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2022-07-13 23:00:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2022-07-13 23:00:00,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 2326. [2022-07-13 23:00:00,385 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-13 23:00:00,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3185 transitions. [2022-07-13 23:00:00,391 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3185 transitions. Word has length 174 [2022-07-13 23:00:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:00:00,392 INFO L495 AbstractCegarLoop]: Abstraction has 2326 states and 3185 transitions. [2022-07-13 23:00:00,392 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-13 23:00:00,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3185 transitions. [2022-07-13 23:00:00,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-13 23:00:00,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:00:00,395 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-13 23:00:00,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 23:00:00,395 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:00:00,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:00:00,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1490806641, now seen corresponding path program 1 times [2022-07-13 23:00:00,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:00:00,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703425004] [2022-07-13 23:00:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:00,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:00:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:00:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:00:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-13 23:00:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-13 23:00:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-13 23:00:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 23:00:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-13 23:00:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 23:00:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 23:00:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:00:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-13 23:00:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-13 23:00:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 23:00:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 23:00:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 23:00:00,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 23:00:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-13 23:00:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 23:00:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:00,756 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-13 23:00:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:00:00,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703425004] [2022-07-13 23:00:00,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703425004] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:00,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594758039] [2022-07-13 23:00:00,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:00,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:00:00,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:00:00,759 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-13 23:00:00,759 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-13 23:00:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:01,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 3110 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-13 23:00:01,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:00:01,449 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-13 23:00:01,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:00:01,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594758039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:00:01,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:00:01,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-07-13 23:00:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848592057] [2022-07-13 23:00:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:00:01,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:00:01,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:00:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:00:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-13 23:00:01,451 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-13 23:00:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:00:01,596 INFO L93 Difference]: Finished difference Result 4637 states and 6351 transitions. [2022-07-13 23:00:01,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:00:01,597 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-13 23:00:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:00:01,605 INFO L225 Difference]: With dead ends: 4637 [2022-07-13 23:00:01,605 INFO L226 Difference]: Without dead ends: 2304 [2022-07-13 23:00:01,610 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-13 23:00:01,611 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-13 23:00:01,611 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-13 23:00:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2022-07-13 23:00:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2304. [2022-07-13 23:00:01,669 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-13 23:00:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3155 transitions. [2022-07-13 23:00:01,675 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3155 transitions. Word has length 179 [2022-07-13 23:00:01,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:00:01,675 INFO L495 AbstractCegarLoop]: Abstraction has 2304 states and 3155 transitions. [2022-07-13 23:00:01,675 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-13 23:00:01,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3155 transitions. [2022-07-13 23:00:01,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-13 23:00:01,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:00:01,678 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-13 23:00:01,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 23:00:01,878 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-13 23:00:01,879 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:00:01,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:00:01,879 INFO L85 PathProgramCache]: Analyzing trace with hash 255731860, now seen corresponding path program 1 times [2022-07-13 23:00:01,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:00:01,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545172449] [2022-07-13 23:00:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:00:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:00:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:00:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 23:00:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 23:00:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:00:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 23:00:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 23:00:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-13 23:00:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 23:00:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-13 23:00:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 23:00:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 23:00:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 23:00:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 23:00:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 23:00:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 23:00:02,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:00:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 23:00:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-13 23:00:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:02,166 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-13 23:00:02,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:00:02,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545172449] [2022-07-13 23:00:02,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545172449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:00:02,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:00:02,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:00:02,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310657871] [2022-07-13 23:00:02,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:00:02,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:00:02,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:00:02,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:00:02,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:00:02,177 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-13 23:00:05,499 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-13 23:00:06,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:00:06,354 INFO L93 Difference]: Finished difference Result 4861 states and 6721 transitions. [2022-07-13 23:00:06,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:00:06,355 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-13 23:00:06,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:00:06,364 INFO L225 Difference]: With dead ends: 4861 [2022-07-13 23:00:06,364 INFO L226 Difference]: Without dead ends: 2588 [2022-07-13 23:00:06,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:00:06,369 INFO L413 NwaCegarLoop]: 1527 mSDtfsCounter, 2479 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 1342 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2617 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 2290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1342 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:00:06,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2617 Valid, 2673 Invalid, 2290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1342 Valid, 947 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-13 23:00:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2588 states. [2022-07-13 23:00:06,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2588 to 2339. [2022-07-13 23:00:06,448 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-13 23:00:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3184 transitions. [2022-07-13 23:00:06,454 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3184 transitions. Word has length 198 [2022-07-13 23:00:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:00:06,454 INFO L495 AbstractCegarLoop]: Abstraction has 2339 states and 3184 transitions. [2022-07-13 23:00:06,454 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-13 23:00:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3184 transitions. [2022-07-13 23:00:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-13 23:00:06,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:00:06,457 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-13 23:00:06,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-13 23:00:06,457 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:00:06,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:00:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1595536580, now seen corresponding path program 1 times [2022-07-13 23:00:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:00:06,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063409169] [2022-07-13 23:00:06,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:06,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:00:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:00:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:00:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 23:00:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 23:00:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:00:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 23:00:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 23:00:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:00:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 23:00:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 23:00:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:00:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 23:00:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-13 23:00:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 23:00:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 23:00:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-07-13 23:00:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:00:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 23:00:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:06,763 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-13 23:00:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:00:06,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063409169] [2022-07-13 23:00:06,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063409169] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:06,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341013253] [2022-07-13 23:00:06,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:06,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:00:06,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:00:06,768 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-13 23:00:06,769 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-13 23:00:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:07,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 3212 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 23:00:07,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:00:07,477 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-13 23:00:07,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:00:07,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341013253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:00:07,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:00:07,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-13 23:00:07,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793089696] [2022-07-13 23:00:07,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:00:07,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:00:07,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:00:07,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:00:07,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-13 23:00:07,479 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-13 23:00:07,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:00:07,636 INFO L93 Difference]: Finished difference Result 4625 states and 6318 transitions. [2022-07-13 23:00:07,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:00:07,636 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-13 23:00:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:00:07,645 INFO L225 Difference]: With dead ends: 4625 [2022-07-13 23:00:07,645 INFO L226 Difference]: Without dead ends: 2349 [2022-07-13 23:00:07,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-13 23:00:07,650 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-13 23:00:07,650 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-13 23:00:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-07-13 23:00:07,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2347. [2022-07-13 23:00:07,729 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-13 23:00:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 3193 transitions. [2022-07-13 23:00:07,734 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 3193 transitions. Word has length 193 [2022-07-13 23:00:07,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:00:07,735 INFO L495 AbstractCegarLoop]: Abstraction has 2347 states and 3193 transitions. [2022-07-13 23:00:07,735 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-13 23:00:07,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 3193 transitions. [2022-07-13 23:00:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-13 23:00:07,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:00:07,754 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-13 23:00:07,777 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-13 23:00:07,967 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-13 23:00:07,968 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:00:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:00:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash -388855203, now seen corresponding path program 1 times [2022-07-13 23:00:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:00:07,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914936241] [2022-07-13 23:00:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:00:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:00:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:00:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-13 23:00:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-13 23:00:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 23:00:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 23:00:08,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 23:00:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-13 23:00:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:00:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 23:00:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 23:00:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-13 23:00:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 23:00:08,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 23:00:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 23:00:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-13 23:00:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-13 23:00:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-13 23:00:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 23:00:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,252 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-13 23:00:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:00:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914936241] [2022-07-13 23:00:08,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914936241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:08,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058251554] [2022-07-13 23:00:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:08,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:00:08,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:00:08,254 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-13 23:00:08,255 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-13 23:00:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:08,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 3231 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-13 23:00:08,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:00:09,113 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-13 23:00:09,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:00:09,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058251554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:00:09,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:00:09,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 19 [2022-07-13 23:00:09,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652658142] [2022-07-13 23:00:09,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:00:09,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 23:00:09,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:00:09,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 23:00:09,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-13 23:00:09,114 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-13 23:00:09,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:00:09,481 INFO L93 Difference]: Finished difference Result 4685 states and 6403 transitions. [2022-07-13 23:00:09,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 23:00:09,482 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-13 23:00:09,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:00:09,505 INFO L225 Difference]: With dead ends: 4685 [2022-07-13 23:00:09,506 INFO L226 Difference]: Without dead ends: 2373 [2022-07-13 23:00:09,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2022-07-13 23:00:09,511 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-13 23:00:09,512 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-13 23:00:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2373 states. [2022-07-13 23:00:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2373 to 2349. [2022-07-13 23:00:09,592 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-13 23:00:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2349 states to 2349 states and 3195 transitions. [2022-07-13 23:00:09,598 INFO L78 Accepts]: Start accepts. Automaton has 2349 states and 3195 transitions. Word has length 196 [2022-07-13 23:00:09,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:00:09,599 INFO L495 AbstractCegarLoop]: Abstraction has 2349 states and 3195 transitions. [2022-07-13 23:00:09,599 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-13 23:00:09,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2349 states and 3195 transitions. [2022-07-13 23:00:09,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-07-13 23:00:09,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:00:09,602 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-13 23:00:09,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 23:00:09,815 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-13 23:00:09,815 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:00:09,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:00:09,816 INFO L85 PathProgramCache]: Analyzing trace with hash 173882668, now seen corresponding path program 1 times [2022-07-13 23:00:09,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:00:09,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127695632] [2022-07-13 23:00:09,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:09,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:00:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:09,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:00:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 23:00:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:00:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 23:00:10,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-13 23:00:10,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 23:00:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 23:00:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 23:00:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:00:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 23:00:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-13 23:00:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:00:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 23:00:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-13 23:00:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-13 23:00:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:00:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 23:00:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-13 23:00:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-13 23:00:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,173 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-13 23:00:10,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:00:10,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127695632] [2022-07-13 23:00:10,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127695632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:10,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968409187] [2022-07-13 23:00:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:10,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:00:10,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:00:10,175 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-13 23:00:10,177 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-13 23:00:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:10,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-13 23:00:10,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:00:10,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:10,852 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-13 23:00:10,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:10,858 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-13 23:00:10,909 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:00:10,909 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-13 23:00:11,137 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:00:11,137 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-13 23:00:11,305 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-13 23:00:11,898 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:00:11,899 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-13 23:00:12,083 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-13 23:00:12,095 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-13 23:00:12,132 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-13 23:00:12,518 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-13 23:00:12,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:12,792 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-13 23:00:12,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:12,798 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-13 23:00:13,286 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-13 23:00:13,291 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-13 23:00:13,328 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-13 23:00:13,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:00:14,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968409187] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:14,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:00:14,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 22] total 32 [2022-07-13 23:00:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243996154] [2022-07-13 23:00:14,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:00:14,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-13 23:00:14,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:00:14,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-13 23:00:14,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1249, Unknown=5, NotChecked=0, Total=1406 [2022-07-13 23:00:14,382 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-13 23:00:21,612 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-13 23:00:24,276 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-13 23:00:26,341 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-13 23:00:28,406 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-13 23:00:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:00:31,514 INFO L93 Difference]: Finished difference Result 4936 states and 6774 transitions. [2022-07-13 23:00:31,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 23:00:31,514 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-13 23:00:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:00:31,522 INFO L225 Difference]: With dead ends: 4936 [2022-07-13 23:00:31,522 INFO L226 Difference]: Without dead ends: 2590 [2022-07-13 23:00:31,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 352 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=320, Invalid=2431, Unknown=5, NotChecked=0, Total=2756 [2022-07-13 23:00:31,529 INFO L413 NwaCegarLoop]: 1507 mSDtfsCounter, 953 mSDsluCounter, 11744 mSDsCounter, 0 mSdLazyCounter, 11084 mSolverCounterSat, 672 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 13251 SdHoareTripleChecker+Invalid, 18330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 11084 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 6570 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:00:31,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 13251 Invalid, 18330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 11084 Invalid, 4 Unknown, 6570 Unchecked, 16.4s Time] [2022-07-13 23:00:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2590 states. [2022-07-13 23:00:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2590 to 2358. [2022-07-13 23:00:31,634 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-13 23:00:31,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2358 states to 2358 states and 3202 transitions. [2022-07-13 23:00:31,639 INFO L78 Accepts]: Start accepts. Automaton has 2358 states and 3202 transitions. Word has length 203 [2022-07-13 23:00:31,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:00:31,639 INFO L495 AbstractCegarLoop]: Abstraction has 2358 states and 3202 transitions. [2022-07-13 23:00:31,640 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-13 23:00:31,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2358 states and 3202 transitions. [2022-07-13 23:00:31,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-13 23:00:31,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:00:31,643 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-13 23:00:31,667 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-13 23:00:31,855 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-13 23:00:31,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:00:31,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:00:31,856 INFO L85 PathProgramCache]: Analyzing trace with hash 781303217, now seen corresponding path program 2 times [2022-07-13 23:00:31,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:00:31,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432265825] [2022-07-13 23:00:31,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:00:31,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:00:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:00:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 23:00:32,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:00:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:00:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:00:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:00:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 23:00:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 23:00:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:00:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:00:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:00:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 23:00:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 23:00:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 23:00:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 23:00:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 23:00:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 23:00:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 23:00:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 23:00:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 23:00:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-13 23:00:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:00:32,465 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-13 23:00:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:00:32,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432265825] [2022-07-13 23:00:32,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432265825] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:32,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135906447] [2022-07-13 23:00:32,466 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 23:00:32,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:00:32,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:00:32,468 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-13 23:00:32,471 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-13 23:00:33,536 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 23:00:33,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 23:00:33,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 3305 conjuncts, 107 conjunts are in the unsatisfiable core [2022-07-13 23:00:33,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:00:33,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:33,565 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-13 23:00:33,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:33,569 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-13 23:00:33,618 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:00:33,619 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-13 23:00:33,768 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-13 23:00:33,955 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:00:33,955 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-13 23:00:34,131 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 23:00:34,131 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-13 23:00:34,327 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-13 23:00:34,982 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-07-13 23:00:34,982 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-13 23:00:35,218 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-13 23:00:35,224 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-13 23:00:35,286 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-13 23:00:35,888 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 23:00:35,888 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-13 23:00:36,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:36,224 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-13 23:00:36,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:00:36,233 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-13 23:00:36,722 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-13 23:00:36,727 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-13 23:00:36,765 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-13 23:00:36,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:00:37,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135906447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:00:37,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:00:37,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 26] total 38 [2022-07-13 23:00:37,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487679980] [2022-07-13 23:00:37,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:00:37,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-13 23:00:37,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:00:37,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-13 23:00:37,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1680, Unknown=9, NotChecked=0, Total=1892 [2022-07-13 23:00:37,659 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-13 23:00:42,375 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-13 23:00:51,529 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-13 23:00:53,593 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-13 23:00:55,664 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-13 23:00:57,728 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-13 23:00:59,801 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-13 23:01:01,877 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-13 23:01:03,952 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-13 23:01:06,021 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-13 23:01:09,301 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:01:11,377 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-13 23:01:13,648 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-13 23:01:15,723 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-13 23:01:17,796 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-13 23:01:19,875 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-13 23:01:21,948 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-13 23:01:24,023 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-13 23:01:27,161 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-13 23:01:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:01:33,186 INFO L93 Difference]: Finished difference Result 7358 states and 10175 transitions. [2022-07-13 23:01:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 23:01:33,187 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-13 23:01:33,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:01:33,198 INFO L225 Difference]: With dead ends: 7358 [2022-07-13 23:01:33,199 INFO L226 Difference]: Without dead ends: 5066 [2022-07-13 23:01:33,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 360 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=459, Invalid=4362, Unknown=9, NotChecked=0, Total=4830 [2022-07-13 23:01:33,206 INFO L413 NwaCegarLoop]: 2920 mSDtfsCounter, 2578 mSDsluCounter, 29182 mSDsCounter, 0 mSdLazyCounter, 20534 mSolverCounterSat, 1493 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2821 SdHoareTripleChecker+Valid, 32102 SdHoareTripleChecker+Invalid, 42144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1493 IncrementalHoareTripleChecker+Valid, 20534 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 20099 IncrementalHoareTripleChecker+Unchecked, 54.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:01:33,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2821 Valid, 32102 Invalid, 42144 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1493 Valid, 20534 Invalid, 18 Unknown, 20099 Unchecked, 54.0s Time] [2022-07-13 23:01:33,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5066 states. [2022-07-13 23:01:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5066 to 4604. [2022-07-13 23:01:33,359 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-13 23:01:33,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4604 states to 4604 states and 6286 transitions. [2022-07-13 23:01:33,371 INFO L78 Accepts]: Start accepts. Automaton has 4604 states and 6286 transitions. Word has length 210 [2022-07-13 23:01:33,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:01:33,371 INFO L495 AbstractCegarLoop]: Abstraction has 4604 states and 6286 transitions. [2022-07-13 23:01:33,371 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-13 23:01:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 4604 states and 6286 transitions. [2022-07-13 23:01:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-13 23:01:33,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:01:33,377 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-13 23:01:33,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-13 23:01:33,595 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-13 23:01:33,596 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:01:33,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:01:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1144769715, now seen corresponding path program 1 times [2022-07-13 23:01:33,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:01:33,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888516782] [2022-07-13 23:01:33,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:01:33,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:01:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:01:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:01:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 23:01:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:01:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:01:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:01:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:01:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 23:01:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 23:01:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:01:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:01:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:01:35,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 23:01:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-13 23:01:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 23:01:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-13 23:01:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 23:01:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-13 23:01:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-13 23:01:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-13 23:01:35,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-13 23:01:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-13 23:01:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:35,613 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-13 23:01:35,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:01:35,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888516782] [2022-07-13 23:01:35,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888516782] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:01:35,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850581985] [2022-07-13 23:01:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:01:35,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:01:35,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:01:35,615 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-13 23:01:35,624 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-13 23:01:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:01:36,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 105 conjunts are in the unsatisfiable core [2022-07-13 23:01:36,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:01:36,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:36,427 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-13 23:01:36,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:36,432 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-13 23:01:36,495 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:01:36,495 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-13 23:01:36,685 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-13 23:01:36,890 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:01:36,890 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-13 23:01:36,981 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:01:36,981 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-13 23:01:37,204 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-13 23:01:37,923 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:01:37,923 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-13 23:01:38,112 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-13 23:01:38,119 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-13 23:01:38,158 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-13 23:01:38,498 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-13 23:01:38,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:38,644 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-13 23:01:38,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:01:38,650 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-13 23:01:38,982 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-13 23:01:38,985 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-13 23:01:39,016 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-13 23:01:39,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:01:39,625 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-13 23:01:39,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850581985] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:01:39,669 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:01:39,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 19] total 43 [2022-07-13 23:01:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980528819] [2022-07-13 23:01:39,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:01:39,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-13 23:01:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:01:39,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-13 23:01:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=1927, Unknown=1, NotChecked=90, Total=2256 [2022-07-13 23:01:39,671 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-13 23:01:53,584 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-13 23:01:55,665 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-13 23:01:57,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:02:00,660 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-13 23:02:02,736 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-13 23:02:04,812 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-13 23:02:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:09,506 INFO L93 Difference]: Finished difference Result 8430 states and 11667 transitions. [2022-07-13 23:02:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-07-13 23:02:09,507 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-13 23:02:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:09,525 INFO L225 Difference]: With dead ends: 8430 [2022-07-13 23:02:09,526 INFO L226 Difference]: Without dead ends: 6131 [2022-07-13 23:02:09,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2765 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=973, Invalid=7772, Unknown=1, NotChecked=184, Total=8930 [2022-07-13 23:02:09,535 INFO L413 NwaCegarLoop]: 1467 mSDtfsCounter, 4867 mSDsluCounter, 10067 mSDsCounter, 0 mSdLazyCounter, 19280 mSolverCounterSat, 3105 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4944 SdHoareTripleChecker+Valid, 11534 SdHoareTripleChecker+Invalid, 26003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3105 IncrementalHoareTripleChecker+Valid, 19280 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 3613 IncrementalHoareTripleChecker+Unchecked, 27.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:09,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4944 Valid, 11534 Invalid, 26003 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3105 Valid, 19280 Invalid, 5 Unknown, 3613 Unchecked, 27.8s Time] [2022-07-13 23:02:09,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6131 states. [2022-07-13 23:02:09,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6131 to 5348. [2022-07-13 23:02:09,764 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-13 23:02:09,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5348 states to 5348 states and 7283 transitions. [2022-07-13 23:02:09,777 INFO L78 Accepts]: Start accepts. Automaton has 5348 states and 7283 transitions. Word has length 210 [2022-07-13 23:02:09,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:09,778 INFO L495 AbstractCegarLoop]: Abstraction has 5348 states and 7283 transitions. [2022-07-13 23:02:09,778 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-13 23:02:09,778 INFO L276 IsEmpty]: Start isEmpty. Operand 5348 states and 7283 transitions. [2022-07-13 23:02:09,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-07-13 23:02:09,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:09,791 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-13 23:02:09,816 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-13 23:02:10,007 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-13 23:02:10,007 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1868991143, now seen corresponding path program 1 times [2022-07-13 23:02:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:10,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650631325] [2022-07-13 23:02:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:10,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 23:02:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:10,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:02:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:02:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 23:02:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 23:02:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:02:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:02:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:02:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 23:02:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 23:02:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-13 23:02:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-13 23:02:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-13 23:02:10,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-13 23:02:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-13 23:02:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-13 23:02:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-13 23:02:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-13 23:02:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,243 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-13 23:02:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650631325] [2022-07-13 23:02:10,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650631325] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:10,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891159439] [2022-07-13 23:02:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:10,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:10,248 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-13 23:02:10,253 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-13 23:02:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:10,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 3302 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:02:10,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:10,912 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-13 23:02:10,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:11,016 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-13 23:02:11,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891159439] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:02:11,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:02:11,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2022-07-13 23:02:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145996187] [2022-07-13 23:02:11,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:02:11,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:02:11,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:11,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:02:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:02:11,018 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-13 23:02:13,789 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-13 23:02:18,785 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-13 23:02:20,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:20,412 INFO L93 Difference]: Finished difference Result 11457 states and 15862 transitions. [2022-07-13 23:02:20,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 23:02:20,419 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-13 23:02:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:20,440 INFO L225 Difference]: With dead ends: 11457 [2022-07-13 23:02:20,440 INFO L226 Difference]: Without dead ends: 6702 [2022-07-13 23:02:20,453 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-13 23:02:20,455 INFO L413 NwaCegarLoop]: 1553 mSDtfsCounter, 1280 mSDsluCounter, 5519 mSDsCounter, 0 mSdLazyCounter, 6210 mSolverCounterSat, 881 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 7072 SdHoareTripleChecker+Invalid, 7093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 6210 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:20,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 7072 Invalid, 7093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 6210 Invalid, 2 Unknown, 0 Unchecked, 9.0s Time] [2022-07-13 23:02:20,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6702 states. [2022-07-13 23:02:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6702 to 5409. [2022-07-13 23:02:20,677 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-13 23:02:20,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5409 states to 5409 states and 7364 transitions. [2022-07-13 23:02:20,690 INFO L78 Accepts]: Start accepts. Automaton has 5409 states and 7364 transitions. Word has length 211 [2022-07-13 23:02:20,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:20,691 INFO L495 AbstractCegarLoop]: Abstraction has 5409 states and 7364 transitions. [2022-07-13 23:02:20,691 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-13 23:02:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5409 states and 7364 transitions. [2022-07-13 23:02:20,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-13 23:02:20,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:20,698 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-13 23:02:20,722 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-13 23:02:20,911 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-13 23:02:20,912 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:20,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:20,912 INFO L85 PathProgramCache]: Analyzing trace with hash -946143103, now seen corresponding path program 1 times [2022-07-13 23:02:20,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:20,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808699209] [2022-07-13 23:02:20,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:20,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:21,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 23:02:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:02:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:22,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:02:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 23:02:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 23:02:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:02:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:02:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:02:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 23:02:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-13 23:02:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 23:02:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-13 23:02:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:02:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 23:02:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-13 23:02:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-13 23:02:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 23:02:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-13 23:02:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:22,601 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-13 23:02:22,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808699209] [2022-07-13 23:02:22,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808699209] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:22,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076608178] [2022-07-13 23:02:22,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:22,603 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-13 23:02:22,604 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-13 23:02:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:23,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 3311 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-13 23:02:23,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:23,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:23,279 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-13 23:02:23,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:23,283 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-13 23:02:23,359 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:02:23,359 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-13 23:02:23,596 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-13 23:02:23,847 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:02:23,847 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-13 23:02:23,985 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:02:23,986 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-13 23:02:24,255 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-13 23:02:25,198 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:02:25,198 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-13 23:02:25,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:25,440 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-13 23:02:25,447 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-13 23:02:25,621 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-13 23:02:26,451 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-13 23:02:26,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:26,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:26,775 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 23:02:26,775 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-13 23:02:26,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:26,783 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-13 23:02:26,799 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 23:02:26,799 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-13 23:02:27,454 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-13 23:02:27,461 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 23:02:27,461 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-13 23:02:27,466 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-13 23:02:27,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:27,766 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-13 23:02:27,986 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-13 23:02:28,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076608178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:28,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:02:28,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 25] total 51 [2022-07-13 23:02:28,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754542647] [2022-07-13 23:02:28,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:02:28,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 23:02:28,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:28,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 23:02:28,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=2687, Unknown=2, NotChecked=214, Total=3192 [2022-07-13 23:02:28,048 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-13 23:02:32,947 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-13 23:02:35,037 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-13 23:02:37,126 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-13 23:02:39,241 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-13 23:02:41,336 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-13 23:02:43,430 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-13 23:02:49,564 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:02:51,739 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-13 23:02:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:55,404 INFO L93 Difference]: Finished difference Result 8316 states and 11332 transitions. [2022-07-13 23:02:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-13 23:02:55,406 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 214 [2022-07-13 23:02:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:55,418 INFO L225 Difference]: With dead ends: 8316 [2022-07-13 23:02:55,419 INFO L226 Difference]: Without dead ends: 5723 [2022-07-13 23:02:55,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=618, Invalid=6194, Unknown=2, NotChecked=326, Total=7140 [2022-07-13 23:02:55,425 INFO L413 NwaCegarLoop]: 1571 mSDtfsCounter, 1147 mSDsluCounter, 6091 mSDsCounter, 0 mSdLazyCounter, 8223 mSolverCounterSat, 646 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 7662 SdHoareTripleChecker+Invalid, 12966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 646 IncrementalHoareTripleChecker+Valid, 8223 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 4089 IncrementalHoareTripleChecker+Unchecked, 25.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:55,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 7662 Invalid, 12966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [646 Valid, 8223 Invalid, 8 Unknown, 4089 Unchecked, 25.7s Time] [2022-07-13 23:02:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5723 states. [2022-07-13 23:02:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5723 to 5527. [2022-07-13 23:02:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5527 states, 4020 states have (on average 1.311691542288557) internal successors, (5273), 4103 states have internal predecessors, (5273), 1106 states have call successors, (1106), 392 states have call predecessors, (1106), 400 states have return successors, (1145), 1080 states have call predecessors, (1145), 1104 states have call successors, (1145) [2022-07-13 23:02:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5527 states to 5527 states and 7524 transitions. [2022-07-13 23:02:55,658 INFO L78 Accepts]: Start accepts. Automaton has 5527 states and 7524 transitions. Word has length 214 [2022-07-13 23:02:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:55,660 INFO L495 AbstractCegarLoop]: Abstraction has 5527 states and 7524 transitions. [2022-07-13 23:02:55,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-13 23:02:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 5527 states and 7524 transitions. [2022-07-13 23:02:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2022-07-13 23:02:55,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:55,668 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 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] [2022-07-13 23:02:55,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:55,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 23:02:55,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:55,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:55,888 INFO L85 PathProgramCache]: Analyzing trace with hash -573587753, now seen corresponding path program 1 times [2022-07-13 23:02:55,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:55,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530152666] [2022-07-13 23:02:55,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:55,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 23:02:57,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-13 23:02:57,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-13 23:02:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 23:02:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 23:02:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-13 23:02:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 23:02:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 23:02:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:57,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-13 23:02:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 23:02:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:02:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-13 23:02:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 23:02:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-13 23:02:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-13 23:02:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-13 23:02:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-13 23:02:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-13 23:02:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-07-13 23:02:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-07-13 23:02:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,091 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-13 23:02:58,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:58,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530152666] [2022-07-13 23:02:58,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530152666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:58,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353560494] [2022-07-13 23:02:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:58,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:58,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:58,094 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:58,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 23:02:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:58,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 3324 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-13 23:02:58,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:58,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:58,794 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-13 23:02:58,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:58,798 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-13 23:02:58,882 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:02:58,882 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-13 23:02:59,121 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-13 23:02:59,346 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:02:59,346 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-13 23:02:59,424 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:02:59,425 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-13 23:02:59,697 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-13 23:03:00,694 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-13 23:03:00,694 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-13 23:03:00,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2022-07-13 23:03:00,975 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-13 23:03:01,167 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-13 23:03:01,916 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-13 23:03:02,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:03:02,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:03:02,212 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 23:03:02,212 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 23 treesize of output 28 [2022-07-13 23:03:02,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:03:02,220 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-13 23:03:02,232 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 23:03:02,232 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-13 23:03:03,161 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 23:03:03,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-07-13 23:03:03,164 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-13 23:03:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 32 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-13 23:03:03,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:03,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| Int) (v_ArrVal_1211 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_29| Int) (v_ArrVal_1209 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23|)) (not (= (select (store |c_#valid| |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_29| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23|) 0)) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| v_ArrVal_1211) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| v_ArrVal_1209) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2022-07-13 23:03:04,136 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| Int) (v_ArrVal_1211 (Array Int Int)) (|v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_29| Int) (v_ArrVal_1209 (Array Int Int)) (v_ArrVal_1207 Int)) (or (not (< |c_#StackHeapBarrier| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23|)) (not (= (select (store (store |c_#valid| |c_ULTIMATE.start_pkt_init_~#__key~3#1.base| v_ArrVal_1207) |v_pkt_ctl_ioctl_~#ctrl_cmd~0#1.base_29| 1) |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23|) 0)) (= (mod (let ((.cse0 (+ 16 |c_~#pkt_devs~0.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| v_ArrVal_1211) |c_~#pkt_devs~0.base|) .cse0) (select (select (store |c_#memory_$Pointer$.base| |v_pkt_ctl_ioctl_~#pkt_dev~0#1.base_23| v_ArrVal_1209) |c_~#pkt_devs~0.base|) .cse0))) 18446744073709551616) 0))) is different from false [2022-07-13 23:03:04,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353560494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:04,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:03:04,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 27] total 51 [2022-07-13 23:03:04,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113424077] [2022-07-13 23:03:04,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:03:04,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-13 23:03:04,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:04,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-13 23:03:04,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=2948, Unknown=2, NotChecked=222, Total=3422 [2022-07-13 23:03:04,169 INFO L87 Difference]: Start difference. First operand 5527 states and 7524 transitions. Second operand has 51 states, 50 states have (on average 5.56) internal successors, (278), 39 states have internal predecessors, (278), 15 states have call successors, (58), 12 states have call predecessors, (58), 15 states have return successors, (52), 21 states have call predecessors, (52), 14 states have call successors, (52)