./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.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 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:23:17,687 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:23:17,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:23:17,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:23:17,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:23:17,709 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:23:17,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:23:17,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:23:17,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:23:17,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:23:17,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:23:17,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:23:17,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:23:17,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:23:17,720 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:23:17,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:23:17,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:23:17,726 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:23:17,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:23:17,732 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:23:17,733 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:23:17,734 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:23:17,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:23:17,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:23:17,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:23:17,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:23:17,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:23:17,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:23:17,739 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:23:17,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:23:17,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:23:17,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:23:17,740 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:23:17,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:23:17,741 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:23:17,742 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:23:17,742 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:23:17,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:23:17,743 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:23:17,743 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:23:17,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:23:17,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:23:17,745 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:23:17,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:23:17,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:23:17,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:23:17,772 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:23:17,773 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:23:17,773 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:23:17,773 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:23:17,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:23:17,774 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:23:17,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:23:17,774 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:23:17,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:23:17,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:23:17,775 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:23:17,775 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:23:17,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:23:17,775 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:23:17,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:23:17,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:23:17,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:23:17,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:23:17,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:23:17,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:23:17,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:23:17,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:23:17,777 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:23:17,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:23:17,777 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:23:17,777 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:23:17,777 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:23:17,777 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 -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2022-07-19 22:23:17,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:23:17,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:23:17,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:23:17,975 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:23:17,976 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:23:17,977 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-07-19 22:23:18,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041243835/6b585c9a71a84a3fb5982fae6214698a/FLAGcf5cd2861 [2022-07-19 22:23:18,571 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:23:18,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-07-19 22:23:18,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041243835/6b585c9a71a84a3fb5982fae6214698a/FLAGcf5cd2861 [2022-07-19 22:23:19,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/041243835/6b585c9a71a84a3fb5982fae6214698a [2022-07-19 22:23:19,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:23:19,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:23:19,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:23:19,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:23:19,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:23:19,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,064 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fc70cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19, skipping insertion in model container [2022-07-19 22:23:19,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:23:19,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:23:19,609 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-07-19 22:23:19,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:23:19,667 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:23:19,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-07-19 22:23:19,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:23:19,786 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:23:19,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19 WrapperNode [2022-07-19 22:23:19,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:23:19,787 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:23:19,787 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:23:19,788 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:23:19,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,864 INFO L137 Inliner]: procedures = 77, calls = 256, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 728 [2022-07-19 22:23:19,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:23:19,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:23:19,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:23:19,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:23:19,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,969 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:19,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:23:19,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:23:19,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:23:19,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:23:19,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (1/1) ... [2022-07-19 22:23:20,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:23:20,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:20,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 22:23:20,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 22:23:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2022-07-19 22:23:20,068 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2022-07-19 22:23:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:23:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-19 22:23:20,068 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-19 22:23:20,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:23:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-07-19 22:23:20,069 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-07-19 22:23:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2022-07-19 22:23:20,069 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2022-07-19 22:23:20,071 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-07-19 22:23:20,071 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-07-19 22:23:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:23:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:23:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-19 22:23:20,072 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-19 22:23:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-19 22:23:20,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-19 22:23:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-19 22:23:20,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-19 22:23:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:23:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-19 22:23:20,073 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-19 22:23:20,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:23:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-19 22:23:20,074 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-19 22:23:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:23:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-19 22:23:20,074 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-19 22:23:20,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-19 22:23:20,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-19 22:23:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-19 22:23:20,075 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-19 22:23:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-19 22:23:20,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-19 22:23:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:23:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:23:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:23:20,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:23:20,281 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:23:20,283 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:23:20,420 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-19 22:23:20,438 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 22:23:21,010 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-19 22:23:21,010 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-19 22:23:21,021 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:23:21,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:23:21,032 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-19 22:23:21,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:23:21 BoogieIcfgContainer [2022-07-19 22:23:21,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:23:21,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:23:21,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:23:21,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:23:21,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:23:19" (1/3) ... [2022-07-19 22:23:21,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6d9e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:23:21, skipping insertion in model container [2022-07-19 22:23:21,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:23:19" (2/3) ... [2022-07-19 22:23:21,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6d9e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:23:21, skipping insertion in model container [2022-07-19 22:23:21,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:23:21" (3/3) ... [2022-07-19 22:23:21,043 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-07-19 22:23:21,053 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:23:21,054 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:23:21,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:23:21,122 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@60f19185, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b38f31 [2022-07-19 22:23:21,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:23:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 127 states have internal predecessors, (158), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-07-19 22:23:21,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 22:23:21,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:21,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:21,135 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 567277314, now seen corresponding path program 1 times [2022-07-19 22:23:21,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:21,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103905899] [2022-07-19 22:23:21,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:21,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:21,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:21,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 22:23:21,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:21,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103905899] [2022-07-19 22:23:21,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103905899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:21,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:23:21,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 22:23:21,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764862406] [2022-07-19 22:23:21,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:21,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:23:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:21,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:23:21,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:23:21,590 INFO L87 Difference]: Start difference. First operand has 163 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 127 states have internal predecessors, (158), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 22:23:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:21,666 INFO L93 Difference]: Finished difference Result 447 states and 604 transitions. [2022-07-19 22:23:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:23:21,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-19 22:23:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:21,682 INFO L225 Difference]: With dead ends: 447 [2022-07-19 22:23:21,683 INFO L226 Difference]: Without dead ends: 287 [2022-07-19 22:23:21,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:23:21,691 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 184 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:21,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 408 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:21,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-19 22:23:21,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 283. [2022-07-19 22:23:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 210 states have (on average 1.2190476190476192) internal successors, (256), 214 states have internal predecessors, (256), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-07-19 22:23:21,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 350 transitions. [2022-07-19 22:23:21,741 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 350 transitions. Word has length 17 [2022-07-19 22:23:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:21,742 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 350 transitions. [2022-07-19 22:23:21,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 22:23:21,742 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 350 transitions. [2022-07-19 22:23:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 22:23:21,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:21,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:21,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:23:21,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:21,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:21,744 INFO L85 PathProgramCache]: Analyzing trace with hash 405605840, now seen corresponding path program 1 times [2022-07-19 22:23:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:21,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843716169] [2022-07-19 22:23:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:21,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:21,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 22:23:21,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:21,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843716169] [2022-07-19 22:23:21,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843716169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:21,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:23:21,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 22:23:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589064469] [2022-07-19 22:23:21,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:21,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:23:21,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:21,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:23:21,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:23:21,830 INFO L87 Difference]: Start difference. First operand 283 states and 350 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 22:23:21,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:21,872 INFO L93 Difference]: Finished difference Result 820 states and 1021 transitions. [2022-07-19 22:23:21,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:23:21,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-07-19 22:23:21,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:21,876 INFO L225 Difference]: With dead ends: 820 [2022-07-19 22:23:21,878 INFO L226 Difference]: Without dead ends: 542 [2022-07-19 22:23:21,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:23:21,883 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 174 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:21,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 417 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-19 22:23:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 535. [2022-07-19 22:23:21,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 398 states have (on average 1.2110552763819096) internal successors, (482), 401 states have internal predecessors, (482), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-19 22:23:21,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 662 transitions. [2022-07-19 22:23:21,926 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 662 transitions. Word has length 18 [2022-07-19 22:23:21,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:21,927 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 662 transitions. [2022-07-19 22:23:21,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 22:23:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 662 transitions. [2022-07-19 22:23:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 22:23:21,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:21,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:21,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 22:23:21,929 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:21,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1497198459, now seen corresponding path program 1 times [2022-07-19 22:23:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:21,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435633715] [2022-07-19 22:23:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:21,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 22:23:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 22:23:22,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:22,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435633715] [2022-07-19 22:23:22,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435633715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:22,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:23:22,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:23:22,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730740662] [2022-07-19 22:23:22,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:22,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:23:22,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:22,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:23:22,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:23:22,113 INFO L87 Difference]: Start difference. First operand 535 states and 662 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 22:23:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:22,374 INFO L93 Difference]: Finished difference Result 1114 states and 1383 transitions. [2022-07-19 22:23:22,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:23:22,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-19 22:23:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:22,382 INFO L225 Difference]: With dead ends: 1114 [2022-07-19 22:23:22,382 INFO L226 Difference]: Without dead ends: 587 [2022-07-19 22:23:22,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:23:22,389 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 53 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:22,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 786 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:23:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-07-19 22:23:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 535. [2022-07-19 22:23:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 398 states have (on average 1.2085427135678393) internal successors, (481), 401 states have internal predecessors, (481), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-19 22:23:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 661 transitions. [2022-07-19 22:23:22,429 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 661 transitions. Word has length 51 [2022-07-19 22:23:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:22,430 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 661 transitions. [2022-07-19 22:23:22,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 22:23:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 661 transitions. [2022-07-19 22:23:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-19 22:23:22,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:22,433 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:22,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:23:22,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:22,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 748380995, now seen corresponding path program 1 times [2022-07-19 22:23:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:22,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82852057] [2022-07-19 22:23:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:22,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 22:23:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 22:23:22,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:22,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82852057] [2022-07-19 22:23:22,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82852057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:22,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:23:22,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:23:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424295786] [2022-07-19 22:23:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:22,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:23:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:23:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:23:22,559 INFO L87 Difference]: Start difference. First operand 535 states and 661 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 22:23:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:22,771 INFO L93 Difference]: Finished difference Result 1233 states and 1565 transitions. [2022-07-19 22:23:22,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:23:22,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-07-19 22:23:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:22,776 INFO L225 Difference]: With dead ends: 1233 [2022-07-19 22:23:22,776 INFO L226 Difference]: Without dead ends: 709 [2022-07-19 22:23:22,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:23:22,778 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 206 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:22,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 474 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:23:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2022-07-19 22:23:22,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 606. [2022-07-19 22:23:22,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 469 states have (on average 1.2409381663113006) internal successors, (582), 472 states have internal predecessors, (582), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-19 22:23:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 762 transitions. [2022-07-19 22:23:22,802 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 762 transitions. Word has length 51 [2022-07-19 22:23:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:22,802 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 762 transitions. [2022-07-19 22:23:22,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 22:23:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 762 transitions. [2022-07-19 22:23:22,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 22:23:22,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:22,804 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-19 22:23:22,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:23:22,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:22,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:22,805 INFO L85 PathProgramCache]: Analyzing trace with hash -38243739, now seen corresponding path program 1 times [2022-07-19 22:23:22,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:22,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585720859] [2022-07-19 22:23:22,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:22,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 22:23:23,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:23,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585720859] [2022-07-19 22:23:23,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585720859] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:23,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197406721] [2022-07-19 22:23:23,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:23,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:23,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:23,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:23,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:23:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 22:23:23,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 22:23:23,495 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:23,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197406721] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:23,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:23,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-19 22:23:23,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830414998] [2022-07-19 22:23:23,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:23,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:23:23,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:23,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:23:23,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:23,498 INFO L87 Difference]: Start difference. First operand 606 states and 762 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:23:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:23,537 INFO L93 Difference]: Finished difference Result 1189 states and 1524 transitions. [2022-07-19 22:23:23,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:23:23,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-07-19 22:23:23,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:23,542 INFO L225 Difference]: With dead ends: 1189 [2022-07-19 22:23:23,542 INFO L226 Difference]: Without dead ends: 596 [2022-07-19 22:23:23,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:23:23,546 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 41 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:23,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 677 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:23,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-19 22:23:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2022-07-19 22:23:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 331 states have (on average 1.2326283987915407) internal successors, (408), 334 states have internal predecessors, (408), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-07-19 22:23:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 528 transitions. [2022-07-19 22:23:23,563 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 528 transitions. Word has length 86 [2022-07-19 22:23:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:23,564 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 528 transitions. [2022-07-19 22:23:23,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:23:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 528 transitions. [2022-07-19 22:23:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-19 22:23:23,569 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:23,569 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:23,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:23,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:23,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:23,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:23,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539649, now seen corresponding path program 1 times [2022-07-19 22:23:23,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:23,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792201490] [2022-07-19 22:23:23,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:23,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:23:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:23:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-19 22:23:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:24,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792201490] [2022-07-19 22:23:24,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792201490] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:24,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011256269] [2022-07-19 22:23:24,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:24,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:24,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:24,052 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:24,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 22:23:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 22:23:24,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 22:23:24,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:24,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011256269] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:24,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:24,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2022-07-19 22:23:24,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498775465] [2022-07-19 22:23:24,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:24,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:23:24,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:24,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:23:24,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-07-19 22:23:24,404 INFO L87 Difference]: Start difference. First operand 426 states and 528 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:23:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:24,520 INFO L93 Difference]: Finished difference Result 906 states and 1163 transitions. [2022-07-19 22:23:24,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:23:24,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-07-19 22:23:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:24,523 INFO L225 Difference]: With dead ends: 906 [2022-07-19 22:23:24,523 INFO L226 Difference]: Without dead ends: 596 [2022-07-19 22:23:24,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:23:24,525 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 185 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1771 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:24,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1771 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:23:24,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-07-19 22:23:24,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 426. [2022-07-19 22:23:24,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 331 states have (on average 1.2265861027190332) internal successors, (406), 334 states have internal predecessors, (406), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-07-19 22:23:24,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 526 transitions. [2022-07-19 22:23:24,541 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 526 transitions. Word has length 83 [2022-07-19 22:23:24,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:24,542 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 526 transitions. [2022-07-19 22:23:24,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:23:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 526 transitions. [2022-07-19 22:23:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-19 22:23:24,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:24,543 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-19 22:23:24,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:24,756 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,SelfDestructingSolverStorable5 [2022-07-19 22:23:24,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 23795875, now seen corresponding path program 1 times [2022-07-19 22:23:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:24,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681038743] [2022-07-19 22:23:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:24,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:24,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,000 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 22:23:25,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:25,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681038743] [2022-07-19 22:23:25,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681038743] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:25,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101362523] [2022-07-19 22:23:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:25,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:25,002 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:25,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 22:23:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 22:23:25,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 22:23:25,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:25,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101362523] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:25,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:25,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-07-19 22:23:25,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451764177] [2022-07-19 22:23:25,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:25,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:23:25,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:23:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:25,430 INFO L87 Difference]: Start difference. First operand 426 states and 526 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:23:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:25,534 INFO L93 Difference]: Finished difference Result 661 states and 817 transitions. [2022-07-19 22:23:25,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:23:25,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-07-19 22:23:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:25,537 INFO L225 Difference]: With dead ends: 661 [2022-07-19 22:23:25,537 INFO L226 Difference]: Without dead ends: 658 [2022-07-19 22:23:25,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:25,538 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 284 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:25,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 375 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:23:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-07-19 22:23:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 636. [2022-07-19 22:23:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 497 states have (on average 1.2374245472837022) internal successors, (615), 498 states have internal predecessors, (615), 88 states have call successors, (88), 51 states have call predecessors, (88), 50 states have return successors, (88), 86 states have call predecessors, (88), 84 states have call successors, (88) [2022-07-19 22:23:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 791 transitions. [2022-07-19 22:23:25,562 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 791 transitions. Word has length 86 [2022-07-19 22:23:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:25,562 INFO L495 AbstractCegarLoop]: Abstraction has 636 states and 791 transitions. [2022-07-19 22:23:25,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:23:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 791 transitions. [2022-07-19 22:23:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-19 22:23:25,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:25,563 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-19 22:23:25,583 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-19 22:23:25,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:25,780 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash -170270410, now seen corresponding path program 1 times [2022-07-19 22:23:25,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:25,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70024757] [2022-07-19 22:23:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:25,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:23:25,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:23:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 22:23:25,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:25,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70024757] [2022-07-19 22:23:25,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70024757] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:25,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:23:25,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:23:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868731422] [2022-07-19 22:23:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:25,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:23:25,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:23:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:23:25,940 INFO L87 Difference]: Start difference. First operand 636 states and 791 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 22:23:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:26,217 INFO L93 Difference]: Finished difference Result 1320 states and 1645 transitions. [2022-07-19 22:23:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:23:26,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2022-07-19 22:23:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:26,220 INFO L225 Difference]: With dead ends: 1320 [2022-07-19 22:23:26,220 INFO L226 Difference]: Without dead ends: 685 [2022-07-19 22:23:26,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:23:26,222 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 163 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:26,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 604 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:23:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-07-19 22:23:26,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 596. [2022-07-19 22:23:26,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 465 states have (on average 1.2236559139784946) internal successors, (569), 466 states have internal predecessors, (569), 86 states have call successors, (86), 45 states have call predecessors, (86), 44 states have return successors, (88), 84 states have call predecessors, (88), 82 states have call successors, (88) [2022-07-19 22:23:26,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 743 transitions. [2022-07-19 22:23:26,251 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 743 transitions. Word has length 96 [2022-07-19 22:23:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:26,251 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 743 transitions. [2022-07-19 22:23:26,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-07-19 22:23:26,251 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 743 transitions. [2022-07-19 22:23:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 22:23:26,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:26,252 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-19 22:23:26,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:23:26,253 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:26,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:26,253 INFO L85 PathProgramCache]: Analyzing trace with hash 320363955, now seen corresponding path program 1 times [2022-07-19 22:23:26,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:26,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563465947] [2022-07-19 22:23:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:26,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:26,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:23:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,445 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 22:23:26,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:26,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563465947] [2022-07-19 22:23:26,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563465947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:26,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891575153] [2022-07-19 22:23:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:26,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:26,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:26,460 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:26,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 22:23:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:26,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 22:23:26,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:27,314 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-07-19 22:23:27,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:23:27,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 31 treesize of output 30 [2022-07-19 22:23:27,441 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-19 22:23:27,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-07-19 22:23:27,464 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 25 treesize of output 17 [2022-07-19 22:23:27,467 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 21 treesize of output 13 [2022-07-19 22:23:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 22:23:27,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:27,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891575153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:27,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:27,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-07-19 22:23:27,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483761459] [2022-07-19 22:23:27,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:27,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:23:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:27,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:23:27,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=241, Unknown=1, NotChecked=30, Total=306 [2022-07-19 22:23:27,526 INFO L87 Difference]: Start difference. First operand 596 states and 743 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:23:27,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:27,942 INFO L93 Difference]: Finished difference Result 702 states and 868 transitions. [2022-07-19 22:23:27,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:23:27,943 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 105 [2022-07-19 22:23:27,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:27,945 INFO L225 Difference]: With dead ends: 702 [2022-07-19 22:23:27,945 INFO L226 Difference]: Without dead ends: 661 [2022-07-19 22:23:27,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=303, Unknown=1, NotChecked=34, Total=380 [2022-07-19 22:23:27,946 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 24 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 238 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:27,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1058 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 238 Unchecked, 0.4s Time] [2022-07-19 22:23:27,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-19 22:23:27,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-07-19 22:23:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 487 states have (on average 1.2258726899383983) internal successors, (597), 490 states have internal predecessors, (597), 90 states have call successors, (90), 49 states have call predecessors, (90), 50 states have return successors, (98), 88 states have call predecessors, (98), 86 states have call successors, (98) [2022-07-19 22:23:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 785 transitions. [2022-07-19 22:23:27,977 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 785 transitions. Word has length 105 [2022-07-19 22:23:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:27,977 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 785 transitions. [2022-07-19 22:23:27,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 8 states have internal predecessors, (69), 5 states have call successors, (12), 3 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-19 22:23:27,977 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 785 transitions. [2022-07-19 22:23:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-19 22:23:27,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:27,978 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-07-19 22:23:28,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:28,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:28,195 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1953167954, now seen corresponding path program 1 times [2022-07-19 22:23:28,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:28,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214746287] [2022-07-19 22:23:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:23:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,396 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 22:23:28,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:28,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214746287] [2022-07-19 22:23:28,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214746287] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:28,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130565844] [2022-07-19 22:23:28,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:28,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:28,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:28,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:28,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 22:23:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:28,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-19 22:23:28,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 22:23:28,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:28,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130565844] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:28,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:28,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-19 22:23:28,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697022651] [2022-07-19 22:23:28,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:28,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:23:28,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:28,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:23:28,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:23:28,818 INFO L87 Difference]: Start difference. First operand 628 states and 785 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:28,957 INFO L93 Difference]: Finished difference Result 1390 states and 1777 transitions. [2022-07-19 22:23:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:23:28,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2022-07-19 22:23:28,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:28,960 INFO L225 Difference]: With dead ends: 1390 [2022-07-19 22:23:28,960 INFO L226 Difference]: Without dead ends: 810 [2022-07-19 22:23:28,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:23:28,962 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 145 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:28,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 2158 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:23:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-19 22:23:28,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 628. [2022-07-19 22:23:28,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 485 states have (on average 1.2185567010309277) internal successors, (591), 491 states have internal predecessors, (591), 88 states have call successors, (88), 49 states have call predecessors, (88), 54 states have return successors, (102), 87 states have call predecessors, (102), 84 states have call successors, (102) [2022-07-19 22:23:28,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 781 transitions. [2022-07-19 22:23:28,996 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 781 transitions. Word has length 105 [2022-07-19 22:23:28,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:28,996 INFO L495 AbstractCegarLoop]: Abstraction has 628 states and 781 transitions. [2022-07-19 22:23:28,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:28,997 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 781 transitions. [2022-07-19 22:23:28,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 22:23:28,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:28,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-07-19 22:23:29,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:29,215 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,SelfDestructingSolverStorable9 [2022-07-19 22:23:29,216 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:29,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1044819566, now seen corresponding path program 1 times [2022-07-19 22:23:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:29,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933676073] [2022-07-19 22:23:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:29,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:23:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 22:23:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:23:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,440 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 22:23:29,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:29,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933676073] [2022-07-19 22:23:29,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933676073] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:29,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491588783] [2022-07-19 22:23:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:29,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:29,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:29,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:29,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 22:23:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:29,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 1251 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-19 22:23:29,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-19 22:23:29,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:29,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491588783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:29,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:29,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 18 [2022-07-19 22:23:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433190776] [2022-07-19 22:23:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:29,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:23:29,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:23:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-07-19 22:23:29,962 INFO L87 Difference]: Start difference. First operand 628 states and 781 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:30,063 INFO L93 Difference]: Finished difference Result 1262 states and 1579 transitions. [2022-07-19 22:23:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:23:30,065 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2022-07-19 22:23:30,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:30,068 INFO L225 Difference]: With dead ends: 1262 [2022-07-19 22:23:30,068 INFO L226 Difference]: Without dead ends: 677 [2022-07-19 22:23:30,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-19 22:23:30,069 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 23 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:30,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1536 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:30,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2022-07-19 22:23:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 648. [2022-07-19 22:23:30,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 500 states have (on average 1.212) internal successors, (606), 505 states have internal predecessors, (606), 88 states have call successors, (88), 49 states have call predecessors, (88), 59 states have return successors, (111), 93 states have call predecessors, (111), 84 states have call successors, (111) [2022-07-19 22:23:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2022-07-19 22:23:30,100 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2022-07-19 22:23:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:30,100 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2022-07-19 22:23:30,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2022-07-19 22:23:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-19 22:23:30,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:30,102 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-07-19 22:23:30,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:30,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:30,316 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:30,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1482829069, now seen corresponding path program 1 times [2022-07-19 22:23:30,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:30,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850376240] [2022-07-19 22:23:30,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:30,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:30,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:23:30,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 22:23:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:23:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,533 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 22:23:30,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:30,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850376240] [2022-07-19 22:23:30,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850376240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:30,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527177999] [2022-07-19 22:23:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:30,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:30,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:30,535 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:30,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-19 22:23:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:30,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 22:23:30,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-19 22:23:30,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:30,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527177999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:30,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:30,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-07-19 22:23:30,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039052715] [2022-07-19 22:23:30,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:30,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:23:30,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:30,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:23:30,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:23:30,986 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:31,109 INFO L93 Difference]: Finished difference Result 856 states and 1088 transitions. [2022-07-19 22:23:31,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:23:31,110 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2022-07-19 22:23:31,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:31,113 INFO L225 Difference]: With dead ends: 856 [2022-07-19 22:23:31,113 INFO L226 Difference]: Without dead ends: 821 [2022-07-19 22:23:31,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:23:31,115 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 186 mSDsluCounter, 1660 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1928 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:31,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1928 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:23:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2022-07-19 22:23:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 648. [2022-07-19 22:23:31,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 500 states have (on average 1.212) internal successors, (606), 505 states have internal predecessors, (606), 88 states have call successors, (88), 49 states have call predecessors, (88), 59 states have return successors, (111), 93 states have call predecessors, (111), 84 states have call successors, (111) [2022-07-19 22:23:31,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 805 transitions. [2022-07-19 22:23:31,146 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 805 transitions. Word has length 107 [2022-07-19 22:23:31,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:31,147 INFO L495 AbstractCegarLoop]: Abstraction has 648 states and 805 transitions. [2022-07-19 22:23:31,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 7 states have internal predecessors, (71), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:31,147 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 805 transitions. [2022-07-19 22:23:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-19 22:23:31,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:31,148 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-07-19 22:23:31,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:31,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:31,360 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash 966922471, now seen corresponding path program 1 times [2022-07-19 22:23:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:31,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397503894] [2022-07-19 22:23:31,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-19 22:23:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-19 22:23:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-19 22:23:31,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-19 22:23:31,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:31,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397503894] [2022-07-19 22:23:31,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397503894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:31,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798556144] [2022-07-19 22:23:31,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:31,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:31,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:31,563 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:31,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-19 22:23:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:31,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 22:23:31,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-19 22:23:32,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:23:32,251 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 22:23:32,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798556144] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:32,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:23:32,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 5] total 17 [2022-07-19 22:23:32,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781900881] [2022-07-19 22:23:32,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:32,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:23:32,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:32,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:23:32,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:23:32,253 INFO L87 Difference]: Start difference. First operand 648 states and 805 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 22:23:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:32,601 INFO L93 Difference]: Finished difference Result 1874 states and 2335 transitions. [2022-07-19 22:23:32,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:23:32,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 108 [2022-07-19 22:23:32,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:32,606 INFO L225 Difference]: With dead ends: 1874 [2022-07-19 22:23:32,606 INFO L226 Difference]: Without dead ends: 1250 [2022-07-19 22:23:32,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:23:32,609 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 359 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:32,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 689 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 22:23:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-07-19 22:23:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1210. [2022-07-19 22:23:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 935 states have (on average 1.2117647058823529) internal successors, (1133), 943 states have internal predecessors, (1133), 163 states have call successors, (163), 92 states have call predecessors, (163), 111 states have return successors, (208), 174 states have call predecessors, (208), 159 states have call successors, (208) [2022-07-19 22:23:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1504 transitions. [2022-07-19 22:23:32,684 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1504 transitions. Word has length 108 [2022-07-19 22:23:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:32,684 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1504 transitions. [2022-07-19 22:23:32,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 4 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 22:23:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1504 transitions. [2022-07-19 22:23:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 22:23:32,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:32,686 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-19 22:23:32,708 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-19 22:23:32,903 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,SelfDestructingSolverStorable12 [2022-07-19 22:23:32,903 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:32,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1819211607, now seen corresponding path program 1 times [2022-07-19 22:23:32,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:32,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471236580] [2022-07-19 22:23:32,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:32,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:32,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:33,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:33,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:23:33,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:33,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471236580] [2022-07-19 22:23:33,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471236580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:33,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386386921] [2022-07-19 22:23:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:33,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:33,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:33,103 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-19 22:23:33,104 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-19 22:23:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:33,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 1779 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 22:23:33,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 22:23:33,646 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:33,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386386921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:33,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:33,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-19 22:23:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232729158] [2022-07-19 22:23:33,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:33,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:23:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:23:33,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:33,647 INFO L87 Difference]: Start difference. First operand 1210 states and 1504 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:33,715 INFO L93 Difference]: Finished difference Result 1861 states and 2314 transitions. [2022-07-19 22:23:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:23:33,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2022-07-19 22:23:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:33,719 INFO L225 Difference]: With dead ends: 1861 [2022-07-19 22:23:33,719 INFO L226 Difference]: Without dead ends: 697 [2022-07-19 22:23:33,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:23:33,721 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 13 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:33,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 589 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2022-07-19 22:23:33,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 667. [2022-07-19 22:23:33,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 515 states have (on average 1.2058252427184466) internal successors, (621), 520 states have internal predecessors, (621), 90 states have call successors, (90), 51 states have call predecessors, (90), 61 states have return successors, (112), 95 states have call predecessors, (112), 86 states have call successors, (112) [2022-07-19 22:23:33,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 823 transitions. [2022-07-19 22:23:33,756 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 823 transitions. Word has length 116 [2022-07-19 22:23:33,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:33,756 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 823 transitions. [2022-07-19 22:23:33,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:33,757 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 823 transitions. [2022-07-19 22:23:33,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-19 22:23:33,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:33,757 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-19 22:23:33,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:33,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-19 22:23:33,971 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:33,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash 2067358101, now seen corresponding path program 1 times [2022-07-19 22:23:33,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:33,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231931453] [2022-07-19 22:23:33,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:33,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:34,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:23:34,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:34,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231931453] [2022-07-19 22:23:34,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231931453] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:34,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870048223] [2022-07-19 22:23:34,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:34,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:34,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:34,165 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:34,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-19 22:23:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:34,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 1778 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 22:23:34,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 22:23:34,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:34,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870048223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:34,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:34,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-07-19 22:23:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123785149] [2022-07-19 22:23:34,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:34,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:23:34,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:34,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:23:34,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:34,820 INFO L87 Difference]: Start difference. First operand 667 states and 823 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:34,933 INFO L93 Difference]: Finished difference Result 1213 states and 1506 transitions. [2022-07-19 22:23:34,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:23:34,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2022-07-19 22:23:34,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:34,937 INFO L225 Difference]: With dead ends: 1213 [2022-07-19 22:23:34,937 INFO L226 Difference]: Without dead ends: 1208 [2022-07-19 22:23:34,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:34,938 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 247 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:34,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:23:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2022-07-19 22:23:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1176. [2022-07-19 22:23:34,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 910 states have (on average 1.2142857142857142) internal successors, (1105), 917 states have internal predecessors, (1105), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2022-07-19 22:23:34,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1466 transitions. [2022-07-19 22:23:34,993 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1466 transitions. Word has length 116 [2022-07-19 22:23:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:34,993 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1466 transitions. [2022-07-19 22:23:34,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-19 22:23:34,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1466 transitions. [2022-07-19 22:23:34,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-19 22:23:34,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:34,994 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:35,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:35,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-19 22:23:35,203 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash 541721343, now seen corresponding path program 1 times [2022-07-19 22:23:35,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:35,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052274333] [2022-07-19 22:23:35,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:35,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:35,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:23:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-19 22:23:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,431 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-19 22:23:35,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:35,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052274333] [2022-07-19 22:23:35,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052274333] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:35,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721287220] [2022-07-19 22:23:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:35,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:35,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:35,448 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:35,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-19 22:23:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:35,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 1834 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 22:23:35,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:23:35,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:35,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721287220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:35,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:35,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-19 22:23:35,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843130235] [2022-07-19 22:23:35,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:35,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:23:35,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:35,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:23:35,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:35,984 INFO L87 Difference]: Start difference. First operand 1176 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 22:23:36,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:36,072 INFO L93 Difference]: Finished difference Result 1368 states and 1732 transitions. [2022-07-19 22:23:36,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:23:36,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2022-07-19 22:23:36,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:36,077 INFO L225 Difference]: With dead ends: 1368 [2022-07-19 22:23:36,077 INFO L226 Difference]: Without dead ends: 1358 [2022-07-19 22:23:36,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:23:36,079 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 213 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:36,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 446 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2022-07-19 22:23:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1182. [2022-07-19 22:23:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 916 states have (on average 1.212882096069869) internal successors, (1111), 923 states have internal predecessors, (1111), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2022-07-19 22:23:36,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1472 transitions. [2022-07-19 22:23:36,167 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1472 transitions. Word has length 129 [2022-07-19 22:23:36,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:36,167 INFO L495 AbstractCegarLoop]: Abstraction has 1182 states and 1472 transitions. [2022-07-19 22:23:36,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-19 22:23:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1472 transitions. [2022-07-19 22:23:36,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-19 22:23:36,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:36,170 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:36,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:36,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-19 22:23:36,383 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:36,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:36,384 INFO L85 PathProgramCache]: Analyzing trace with hash -554191626, now seen corresponding path program 1 times [2022-07-19 22:23:36,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:36,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265259516] [2022-07-19 22:23:36,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:36,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:23:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-19 22:23:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-07-19 22:23:36,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:36,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265259516] [2022-07-19 22:23:36,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265259516] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:36,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772083095] [2022-07-19 22:23:36,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:36,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:36,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:36,623 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:36,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-19 22:23:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 1846 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 22:23:37,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:23:37,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:37,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772083095] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:37,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:37,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-19 22:23:37,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639639242] [2022-07-19 22:23:37,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:37,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 22:23:37,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:37,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 22:23:37,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:37,269 INFO L87 Difference]: Start difference. First operand 1182 states and 1472 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 22:23:37,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:37,395 INFO L93 Difference]: Finished difference Result 2302 states and 2876 transitions. [2022-07-19 22:23:37,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 22:23:37,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 133 [2022-07-19 22:23:37,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:37,400 INFO L225 Difference]: With dead ends: 2302 [2022-07-19 22:23:37,400 INFO L226 Difference]: Without dead ends: 1110 [2022-07-19 22:23:37,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:23:37,403 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 46 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:37,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 423 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-07-19 22:23:37,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2022-07-19 22:23:37,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 844 states have (on average 1.15521327014218) internal successors, (975), 851 states have internal predecessors, (975), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2022-07-19 22:23:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1336 transitions. [2022-07-19 22:23:37,472 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1336 transitions. Word has length 133 [2022-07-19 22:23:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:37,472 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1336 transitions. [2022-07-19 22:23:37,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-19 22:23:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1336 transitions. [2022-07-19 22:23:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-19 22:23:37,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:37,473 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-19 22:23:37,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:37,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-19 22:23:37,676 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:37,676 INFO L85 PathProgramCache]: Analyzing trace with hash 78838695, now seen corresponding path program 1 times [2022-07-19 22:23:37,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:37,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289741812] [2022-07-19 22:23:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:23:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 22:23:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:23:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:23:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:23:37,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:37,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289741812] [2022-07-19 22:23:37,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289741812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:37,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929509350] [2022-07-19 22:23:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:37,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:37,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:37,913 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:37,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-19 22:23:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:38,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-19 22:23:38,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-19 22:23:38,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:38,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929509350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:38,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:38,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 19 [2022-07-19 22:23:38,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331512333] [2022-07-19 22:23:38,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:38,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:23:38,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:38,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:23:38,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:23:38,658 INFO L87 Difference]: Start difference. First operand 1110 states and 1336 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-19 22:23:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:38,793 INFO L93 Difference]: Finished difference Result 2194 states and 2647 transitions. [2022-07-19 22:23:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:23:38,793 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2022-07-19 22:23:38,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:38,798 INFO L225 Difference]: With dead ends: 2194 [2022-07-19 22:23:38,798 INFO L226 Difference]: Without dead ends: 1139 [2022-07-19 22:23:38,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:23:38,806 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 27 mSDsluCounter, 1385 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:38,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1590 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:38,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2022-07-19 22:23:38,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1110. [2022-07-19 22:23:38,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 844 states have (on average 1.1492890995260663) internal successors, (970), 851 states have internal predecessors, (970), 154 states have call successors, (154), 91 states have call predecessors, (154), 111 states have return successors, (207), 167 states have call predecessors, (207), 150 states have call successors, (207) [2022-07-19 22:23:38,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1331 transitions. [2022-07-19 22:23:38,865 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1331 transitions. Word has length 144 [2022-07-19 22:23:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:38,867 INFO L495 AbstractCegarLoop]: Abstraction has 1110 states and 1331 transitions. [2022-07-19 22:23:38,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 7 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-19 22:23:38,867 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1331 transitions. [2022-07-19 22:23:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-19 22:23:38,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:38,868 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:38,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:39,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-19 22:23:39,083 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 92371496, now seen corresponding path program 2 times [2022-07-19 22:23:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:39,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129575239] [2022-07-19 22:23:39,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:39,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:23:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-19 22:23:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 22:23:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 22:23:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:39,320 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:23:39,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:39,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129575239] [2022-07-19 22:23:39,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129575239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:39,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831238056] [2022-07-19 22:23:39,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:23:39,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:39,322 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:39,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-19 22:23:39,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 22:23:39,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:23:39,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 1579 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 22:23:39,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 22:23:39,973 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831238056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:39,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:39,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-19 22:23:39,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611623253] [2022-07-19 22:23:39,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:39,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:23:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:39,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:23:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:23:39,975 INFO L87 Difference]: Start difference. First operand 1110 states and 1331 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 22:23:40,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:40,015 INFO L93 Difference]: Finished difference Result 1765 states and 2122 transitions. [2022-07-19 22:23:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:23:40,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2022-07-19 22:23:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:40,019 INFO L225 Difference]: With dead ends: 1765 [2022-07-19 22:23:40,019 INFO L226 Difference]: Without dead ends: 717 [2022-07-19 22:23:40,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:23:40,023 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:40,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 360 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:40,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-07-19 22:23:40,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 713. [2022-07-19 22:23:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 543 states have (on average 1.138121546961326) internal successors, (618), 548 states have internal predecessors, (618), 100 states have call successors, (100), 61 states have call predecessors, (100), 69 states have return successors, (122), 103 states have call predecessors, (122), 96 states have call successors, (122) [2022-07-19 22:23:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 840 transitions. [2022-07-19 22:23:40,063 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 840 transitions. Word has length 144 [2022-07-19 22:23:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:40,063 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 840 transitions. [2022-07-19 22:23:40,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 22:23:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 840 transitions. [2022-07-19 22:23:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-19 22:23:40,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:40,065 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:40,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:40,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:40,274 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:40,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:40,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1279560877, now seen corresponding path program 1 times [2022-07-19 22:23:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:40,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846876455] [2022-07-19 22:23:40,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:40,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:23:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:23:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:23:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 22:23:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:23:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:40,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846876455] [2022-07-19 22:23:40,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846876455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:40,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413394864] [2022-07-19 22:23:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:40,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:40,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:40,488 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:40,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-19 22:23:41,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 1887 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 22:23:41,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 22:23:41,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:41,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413394864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:41,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:41,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-07-19 22:23:41,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147050531] [2022-07-19 22:23:41,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:41,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:23:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:41,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:23:41,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:23:41,282 INFO L87 Difference]: Start difference. First operand 713 states and 840 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 22:23:41,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:41,530 INFO L93 Difference]: Finished difference Result 1338 states and 1585 transitions. [2022-07-19 22:23:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:23:41,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 146 [2022-07-19 22:23:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:41,533 INFO L225 Difference]: With dead ends: 1338 [2022-07-19 22:23:41,533 INFO L226 Difference]: Without dead ends: 653 [2022-07-19 22:23:41,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:23:41,535 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 149 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:41,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 511 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:23:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2022-07-19 22:23:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 596. [2022-07-19 22:23:41,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 456 states have (on average 1.1337719298245614) internal successors, (517), 461 states have internal predecessors, (517), 84 states have call successors, (84), 49 states have call predecessors, (84), 55 states have return successors, (102), 85 states have call predecessors, (102), 81 states have call successors, (102) [2022-07-19 22:23:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 703 transitions. [2022-07-19 22:23:41,564 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 703 transitions. Word has length 146 [2022-07-19 22:23:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:41,564 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 703 transitions. [2022-07-19 22:23:41,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 22:23:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 703 transitions. [2022-07-19 22:23:41,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:23:41,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:41,566 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:41,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:41,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:41,775 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1011559813, now seen corresponding path program 1 times [2022-07-19 22:23:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:41,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513166221] [2022-07-19 22:23:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:42,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:23:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:23:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:23:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:42,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 22:23:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:42,029 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:23:42,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:42,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513166221] [2022-07-19 22:23:42,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513166221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:42,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692547653] [2022-07-19 22:23:42,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:42,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:42,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:42,031 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:42,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-19 22:23:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:42,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-19 22:23:42,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 22:23:42,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:42,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692547653] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:42,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:42,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 16 [2022-07-19 22:23:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888304355] [2022-07-19 22:23:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:42,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:23:42,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:42,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:23:42,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:23:42,862 INFO L87 Difference]: Start difference. First operand 596 states and 703 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-19 22:23:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:43,027 INFO L93 Difference]: Finished difference Result 1241 states and 1469 transitions. [2022-07-19 22:23:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:23:43,028 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) Word has length 147 [2022-07-19 22:23:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:43,030 INFO L225 Difference]: With dead ends: 1241 [2022-07-19 22:23:43,030 INFO L226 Difference]: Without dead ends: 673 [2022-07-19 22:23:43,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:23:43,033 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 35 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:43,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1706 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:23:43,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-07-19 22:23:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 633. [2022-07-19 22:23:43,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 488 states have (on average 1.1311475409836065) internal successors, (552), 490 states have internal predecessors, (552), 84 states have call successors, (84), 49 states have call predecessors, (84), 60 states have return successors, (110), 93 states have call predecessors, (110), 81 states have call successors, (110) [2022-07-19 22:23:43,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 746 transitions. [2022-07-19 22:23:43,064 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 746 transitions. Word has length 147 [2022-07-19 22:23:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:43,065 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 746 transitions. [2022-07-19 22:23:43,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 8 states have internal predecessors, (101), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 4 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-19 22:23:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 746 transitions. [2022-07-19 22:23:43,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-19 22:23:43,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:43,065 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-07-19 22:23:43,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:43,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:43,280 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:43,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:43,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2093368100, now seen corresponding path program 2 times [2022-07-19 22:23:43,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:43,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121236258] [2022-07-19 22:23:43,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:43,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:43,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:43,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:43,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:23:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:23:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-19 22:23:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-19 22:23:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-19 22:23:43,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:43,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121236258] [2022-07-19 22:23:43,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121236258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:43,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734696512] [2022-07-19 22:23:43,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:23:43,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:43,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:43,500 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:43,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-19 22:23:44,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 22:23:44,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:23:44,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 1581 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 22:23:44,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 22:23:44,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:44,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734696512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:44,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:44,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [13] total 14 [2022-07-19 22:23:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252897742] [2022-07-19 22:23:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:44,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 22:23:44,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 22:23:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:23:44,221 INFO L87 Difference]: Start difference. First operand 633 states and 746 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 22:23:44,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:44,234 INFO L93 Difference]: Finished difference Result 660 states and 770 transitions. [2022-07-19 22:23:44,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 22:23:44,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2022-07-19 22:23:44,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:44,237 INFO L225 Difference]: With dead ends: 660 [2022-07-19 22:23:44,237 INFO L226 Difference]: Without dead ends: 259 [2022-07-19 22:23:44,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:23:44,239 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 4 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:44,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:44,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2022-07-19 22:23:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 245. [2022-07-19 22:23:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 186 states have (on average 1.0913978494623655) internal successors, (203), 189 states have internal predecessors, (203), 34 states have call successors, (34), 22 states have call predecessors, (34), 24 states have return successors, (37), 33 states have call predecessors, (37), 32 states have call successors, (37) [2022-07-19 22:23:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 274 transitions. [2022-07-19 22:23:44,254 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 274 transitions. Word has length 147 [2022-07-19 22:23:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:44,254 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 274 transitions. [2022-07-19 22:23:44,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-19 22:23:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 274 transitions. [2022-07-19 22:23:44,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-19 22:23:44,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:23:44,256 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:23:44,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-19 22:23:44,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:44,471 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:23:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:23:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash 301053376, now seen corresponding path program 1 times [2022-07-19 22:23:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:23:44,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4691957] [2022-07-19 22:23:44,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:23:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 22:23:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 22:23:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-19 22:23:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-19 22:23:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-19 22:23:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-19 22:23:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:23:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:23:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-19 22:23:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:23:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:23:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-19 22:23:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:23:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-19 22:23:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-19 22:23:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:23:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-07-19 22:23:44,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:23:44,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4691957] [2022-07-19 22:23:44,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4691957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:23:44,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668413423] [2022-07-19 22:23:44,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:23:44,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:44,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:23:44,692 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:23:44,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-19 22:23:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:23:45,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 2048 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-19 22:23:45,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:23:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-07-19 22:23:45,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:23:45,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668413423] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:23:45,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:23:45,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 16 [2022-07-19 22:23:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034263967] [2022-07-19 22:23:45,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:23:45,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:23:45,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:23:45,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:23:45,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:23:45,504 INFO L87 Difference]: Start difference. First operand 245 states and 274 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-19 22:23:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:23:45,552 INFO L93 Difference]: Finished difference Result 251 states and 279 transitions. [2022-07-19 22:23:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:23:45,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 177 [2022-07-19 22:23:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:23:45,553 INFO L225 Difference]: With dead ends: 251 [2022-07-19 22:23:45,553 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:23:45,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-19 22:23:45,554 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 36 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:23:45,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 572 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:23:45,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:23:45,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:23:45,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 22:23:45,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:23:45,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2022-07-19 22:23:45,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:23:45,555 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:23:45,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-19 22:23:45,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:23:45,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:23:45,558 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:23:45,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-19 22:23:45,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:23:45,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 22:23:53,926 WARN L233 SmtUtils]: Spent 6.65s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 22:24:01,742 WARN L233 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 135 DAG size of output: 131 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 22:24:11,705 INFO L902 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2022-07-19 22:24:11,705 INFO L899 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2022-07-19 22:24:11,705 INFO L902 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2022-07-19 22:24:11,706 INFO L902 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2022-07-19 22:24:11,706 INFO L902 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2022-07-19 22:24:11,706 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2022-07-19 22:24:11,706 INFO L899 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2022-07-19 22:24:11,706 INFO L899 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2022-07-19 22:24:11,706 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2022-07-19 22:24:11,706 INFO L895 garLoopResultBuilder]: At program point dev_get_drvdataENTRY(lines 4209 4211) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-19 22:24:11,706 INFO L895 garLoopResultBuilder]: At program point L4210(line 4210) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 1)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-19 22:24:11,706 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2022-07-19 22:24:11,706 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2022-07-19 22:24:11,707 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 4264 4266) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2022-07-19 22:24:11,707 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2022-07-19 22:24:11,707 INFO L899 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2022-07-19 22:24:11,707 INFO L902 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2022-07-19 22:24:11,707 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2022-07-19 22:24:11,707 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2022-07-19 22:24:11,707 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2022-07-19 22:24:11,707 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2022-07-19 22:24:11,707 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2022-07-19 22:24:11,708 INFO L895 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .cse1 (not (= ~ldv_coherent_state~0 1)) .cse2 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse2))) [2022-07-19 22:24:11,708 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2022-07-19 22:24:11,708 INFO L902 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2022-07-19 22:24:11,708 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2022-07-19 22:24:11,708 INFO L895 garLoopResultBuilder]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-19 22:24:11,708 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2022-07-19 22:24:11,708 INFO L895 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 4150 4179) the Hoare annotation is: (or (= ~ldv_urb_state~0 1) (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-19 22:24:11,708 INFO L899 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2022-07-19 22:24:11,708 INFO L899 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2022-07-19 22:24:11,708 INFO L895 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0)) (and (= ~ldv_urb_state~0 0) (not (= (mod (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset) 18446744073709551616) 0)))) [2022-07-19 22:24:11,709 INFO L895 garLoopResultBuilder]: At program point L4166(line 4166) the Hoare annotation is: (or (not (= 1 |old(~ldv_urb_state~0)|)) (not (= ~ldv_coherent_state~0 1)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-19 22:24:11,709 INFO L899 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2022-07-19 22:24:11,709 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2022-07-19 22:24:11,709 INFO L902 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2022-07-19 22:24:11,709 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2022-07-19 22:24:11,709 INFO L899 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2022-07-19 22:24:11,709 INFO L902 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2022-07-19 22:24:11,709 INFO L902 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2022-07-19 22:24:11,709 INFO L899 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2022-07-19 22:24:11,710 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 4201 4205) the Hoare annotation is: (let ((.cse2 (not (= ~ldv_coherent_state~0 1))) (.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 .cse1 .cse2 .cse3 (and (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)) (forall ((|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1| Int)) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset_BEFORE_CALL_1|) 0)))) (or (not (= ~ldv_urb_state~0 1)) .cse1 .cse2 .cse3) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse3))) [2022-07-19 22:24:11,710 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2022-07-19 22:24:11,710 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2022-07-19 22:24:11,710 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2022-07-19 22:24:11,710 INFO L895 garLoopResultBuilder]: At program point L4207(line 4207) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-19 22:24:11,710 INFO L899 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2022-07-19 22:24:11,710 INFO L902 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2022-07-19 22:24:11,710 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2022-07-19 22:24:11,710 INFO L902 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2022-07-19 22:24:11,710 INFO L895 garLoopResultBuilder]: At program point kzallocENTRY(lines 3405 3413) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0))) [2022-07-19 22:24:11,711 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2022-07-19 22:24:11,711 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2022-07-19 22:24:11,711 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2022-07-19 22:24:11,711 INFO L895 garLoopResultBuilder]: At program point L4117(lines 4093 4122) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse3 (not (= |old(~ldv_coherent_state~0)| 1)))) (and (let ((.cse1 (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base)) (.cse2 (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset))) (or .cse0 (and (= |usb_free_coherent_#in~addr.base| 0) (<= 1 ~ldv_coherent_state~0) (= |usb_free_coherent_#in~addr.offset| 0) .cse1 .cse2) .cse3 (and (= ~ldv_coherent_state~0 0) .cse1 .cse2))) (or (not (= (mod (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset) 18446744073709551616) 0)) .cse0 (not (= 0 ~res_kbtab_probe_3~0)) .cse3))) [2022-07-19 22:24:11,711 INFO L895 garLoopResultBuilder]: At program point usb_free_coherentENTRY(lines 4093 4122) the Hoare annotation is: (or (= ~ldv_coherent_state~0 1) (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2022-07-19 22:24:11,711 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2022-07-19 22:24:11,711 INFO L895 garLoopResultBuilder]: At program point L4109(line 4109) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (not (= |old(~ldv_coherent_state~0)| 1))) [2022-07-19 22:24:11,711 INFO L899 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2022-07-19 22:24:11,711 INFO L902 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2022-07-19 22:24:11,712 INFO L899 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2022-07-19 22:24:11,712 INFO L895 garLoopResultBuilder]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (or (not (= ~ldv_urb_state~0 0)) (and (= ~ldv_coherent_state~0 1) (= |usb_free_coherent_#in~addr.base| usb_free_coherent_~addr.base) (= |usb_free_coherent_#in~addr.offset| usb_free_coherent_~addr.offset)) (not (= |old(~ldv_coherent_state~0)| 1))) [2022-07-19 22:24:11,712 INFO L899 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2022-07-19 22:24:11,712 INFO L899 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2022-07-19 22:24:11,712 INFO L895 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-19 22:24:11,712 INFO L899 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2022-07-19 22:24:11,712 INFO L895 garLoopResultBuilder]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2022-07-19 22:24:11,712 INFO L895 garLoopResultBuilder]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,712 INFO L895 garLoopResultBuilder]: At program point L3884(line 3884) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-19 22:24:11,713 INFO L899 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2022-07-19 22:24:11,713 INFO L899 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2022-07-19 22:24:11,713 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2022-07-19 22:24:11,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 22:24:11,713 INFO L899 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2022-07-19 22:24:11,713 INFO L895 garLoopResultBuilder]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-07-19 22:24:11,713 INFO L899 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2022-07-19 22:24:11,713 INFO L895 garLoopResultBuilder]: At program point L3885(line 3885) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1)) [2022-07-19 22:24:11,713 INFO L899 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2022-07-19 22:24:11,713 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2022-07-19 22:24:11,714 INFO L899 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2022-07-19 22:24:11,714 INFO L895 garLoopResultBuilder]: At program point L3886(line 3886) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0)) [2022-07-19 22:24:11,714 INFO L899 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2022-07-19 22:24:11,714 INFO L895 garLoopResultBuilder]: At program point L3886-1(lines 3875 3890) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0)) [2022-07-19 22:24:11,714 INFO L895 garLoopResultBuilder]: At program point L4233(lines 4232 4234) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse3 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse5 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse4 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= (+ 12 ~res_kbtab_probe_3~0) 0) .cse1 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse3 .cse4 .cse5 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse2 .cse6) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse3 (not .cse6) .cse5 .cse1 .cse2 (not .cse4)))) [2022-07-19 22:24:11,714 INFO L899 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2022-07-19 22:24:11,714 INFO L899 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2022-07-19 22:24:11,714 INFO L895 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2022-07-19 22:24:11,714 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-07-19 22:24:11,715 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2022-07-19 22:24:11,715 INFO L899 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2022-07-19 22:24:11,715 INFO L899 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2022-07-19 22:24:11,715 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2022-07-19 22:24:11,715 INFO L899 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2022-07-19 22:24:11,715 INFO L899 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2022-07-19 22:24:11,715 INFO L895 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-07-19 22:24:11,715 INFO L895 garLoopResultBuilder]: At program point L3426(line 3426) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-19 22:24:11,715 INFO L895 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse5 (= ~ldv_coherent_state~0 0)) (.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse6 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) .cse3 .cse4) (and .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse5 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 .cse1 (not .cse4) .cse2 .cse6 .cse3))) [2022-07-19 22:24:11,716 INFO L899 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2022-07-19 22:24:11,716 INFO L895 garLoopResultBuilder]: At program point L3839-1(line 3839) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,716 INFO L895 garLoopResultBuilder]: At program point L3839(line 3839) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,716 INFO L895 garLoopResultBuilder]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,716 INFO L895 garLoopResultBuilder]: At program point L3856(line 3856) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-07-19 22:24:11,716 INFO L899 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2022-07-19 22:24:11,716 INFO L895 garLoopResultBuilder]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-07-19 22:24:11,716 INFO L895 garLoopResultBuilder]: At program point L3972(line 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-07-19 22:24:11,717 INFO L899 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2022-07-19 22:24:11,717 INFO L895 garLoopResultBuilder]: At program point L3840(line 3840) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,717 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:24:11,717 INFO L899 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2022-07-19 22:24:11,717 INFO L895 garLoopResultBuilder]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2))) [2022-07-19 22:24:11,717 INFO L895 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2022-07-19 22:24:11,717 INFO L895 garLoopResultBuilder]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,717 INFO L895 garLoopResultBuilder]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,718 INFO L895 garLoopResultBuilder]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-19 22:24:11,718 INFO L895 garLoopResultBuilder]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,718 INFO L899 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2022-07-19 22:24:11,718 INFO L895 garLoopResultBuilder]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (.cse4 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (= ~ldv_coherent_state~0 0) .cse0 .cse1 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0) .cse2 .cse3 .cse4) (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 (= ~ldv_coherent_state~0 1) .cse3 (not .cse2) .cse4))) [2022-07-19 22:24:11,718 INFO L895 garLoopResultBuilder]: At program point L4073(line 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,718 INFO L899 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2022-07-19 22:24:11,718 INFO L895 garLoopResultBuilder]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2022-07-19 22:24:11,718 INFO L899 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2022-07-19 22:24:11,718 INFO L895 garLoopResultBuilder]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,719 INFO L899 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2022-07-19 22:24:11,719 INFO L895 garLoopResultBuilder]: At program point L3529(line 3529) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,719 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:24:11,719 INFO L899 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2022-07-19 22:24:11,719 INFO L895 garLoopResultBuilder]: At program point L3513(line 3513) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,719 INFO L895 garLoopResultBuilder]: At program point L3513-2(lines 3512 3514) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,719 INFO L899 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2022-07-19 22:24:11,719 INFO L895 garLoopResultBuilder]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,719 INFO L899 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2022-07-19 22:24:11,720 INFO L895 garLoopResultBuilder]: At program point L3861(line 3861) the Hoare annotation is: (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-07-19 22:24:11,720 INFO L895 garLoopResultBuilder]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,720 INFO L895 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-19 22:24:11,720 INFO L899 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2022-07-19 22:24:11,720 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2022-07-19 22:24:11,720 INFO L899 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2022-07-19 22:24:11,720 INFO L895 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-07-19 22:24:11,720 INFO L895 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2022-07-19 22:24:11,720 INFO L895 garLoopResultBuilder]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-07-19 22:24:11,721 INFO L895 garLoopResultBuilder]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-07-19 22:24:11,721 INFO L895 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ~ldv_coherent_state~0 1)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-07-19 22:24:11,721 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2022-07-19 22:24:11,721 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:24:11,721 INFO L895 garLoopResultBuilder]: At program point L3798(line 3798) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,721 INFO L899 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2022-07-19 22:24:11,721 INFO L895 garLoopResultBuilder]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,721 INFO L899 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2022-07-19 22:24:11,721 INFO L899 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2022-07-19 22:24:11,722 INFO L895 garLoopResultBuilder]: At program point L3865(line 3865) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= ~ldv_urb_state~0 0)) (.cse3 (= ~ldv_coherent_state~0 1)) (.cse4 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse5 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (or (not (= |ULTIMATE.start_kbtab_probe_#t~mem80#1.base| 0)) (not (= |ULTIMATE.start_kbtab_probe_#t~mem80#1.offset| 0))) .cse1 .cse2 .cse3 .cse4 .cse5 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-07-19 22:24:11,722 INFO L895 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse7 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse8 (= ~ldv_coherent_state~0 1)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) (.cse6 (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)))) (.cse5 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (let ((.cse4 (not .cse7))) (or (and .cse0 .cse1 (not (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0)) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse5))) (= 0 ~res_kbtab_probe_3~0) .cse8 (= ~ldv_urb_state~0 1)) (and .cse0 .cse1 .cse7 (= ~ldv_urb_state~0 0) .cse8 .cse2 .cse3 .cse6 .cse5 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)))) [2022-07-19 22:24:11,722 INFO L899 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2022-07-19 22:24:11,722 INFO L895 garLoopResultBuilder]: At program point L3882(line 3882) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-19 22:24:11,722 INFO L899 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2022-07-19 22:24:11,722 INFO L895 garLoopResultBuilder]: At program point L4130(line 4130) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base|) |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset|) 0))) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-07-19 22:24:11,722 INFO L895 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse0 (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| |ULTIMATE.start_main_~tmp___8~3#1|)))) (or (and .cse0 (<= 0 ~ldv_coherent_state~0) .cse1 .cse2 .cse3 .cse4 (<= 0 ~ldv_urb_state~0) (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (and .cse0 .cse1 .cse2 .cse3 (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) (and (= ~ldv_coherent_state~0 0) .cse1 .cse4 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-07-19 22:24:11,723 INFO L895 garLoopResultBuilder]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_coherent_state~0 1) (= ~ldv_urb_state~0 1)) [2022-07-19 22:24:11,723 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2022-07-19 22:24:11,723 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2022-07-19 22:24:11,723 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2022-07-19 22:24:11,723 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2022-07-19 22:24:11,723 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2022-07-19 22:24:11,724 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2022-07-19 22:24:11,724 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2022-07-19 22:24:11,727 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:24:11,728 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:24:11,743 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,756 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:24:11 BoogieIcfgContainer [2022-07-19 22:24:11,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:24:11,765 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:24:11,765 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:24:11,765 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:24:11,765 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:23:21" (3/4) ... [2022-07-19 22:24:11,767 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 22:24:11,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2022-07-19 22:24:11,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2022-07-19 22:24:11,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-07-19 22:24:11,771 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-07-19 22:24:11,772 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-07-19 22:24:11,781 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 73 nodes and edges [2022-07-19 22:24:11,781 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-07-19 22:24:11,782 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-19 22:24:11,783 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-19 22:24:11,784 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 22:24:11,810 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 == \old(ldv_urb_state)) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3)) || (ldv_urb_state == 0 && !((urb + urb) % 18446744073709551616 == 0)) [2022-07-19 22:24:11,810 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(ldv_urb_state == 0) || ((((addr == 0 && 1 <= ldv_coherent_state) && addr == 0) && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1)) || ((ldv_coherent_state == 0 && addr == addr) && addr == addr)) && (((!((addr + addr) % 18446744073709551616 == 0) || !(ldv_urb_state == 0)) || !(0 == res_kbtab_probe_3)) || !(\old(ldv_coherent_state) == 1)) [2022-07-19 22:24:11,810 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) || (((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) [2022-07-19 22:24:11,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(ldv_urb_state == 0) || ((ldv_coherent_state == 1 && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1) [2022-07-19 22:24:11,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-07-19 22:24:11,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) [2022-07-19 22:24:11,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) [2022-07-19 22:24:11,812 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0)) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) || (((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) && 0 == \result) [2022-07-19 22:24:11,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-19 22:24:11,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((ldv_urb_state == 1 || !(1 == \old(ldv_urb_state))) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3) [2022-07-19 22:24:11,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0 [2022-07-19 22:24:11,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-19 22:24:11,813 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-19 22:24:11,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-19 22:24:11,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-19 22:24:11,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-19 22:24:11,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-07-19 22:24:11,814 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) [2022-07-19 22:24:11,881 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 22:24:11,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:24:11,882 INFO L158 Benchmark]: Toolchain (without parser) took 52823.35ms. Allocated memory was 90.2MB in the beginning and 744.5MB in the end (delta: 654.3MB). Free memory was 50.1MB in the beginning and 603.3MB in the end (delta: -553.2MB). Peak memory consumption was 100.2MB. Max. memory is 16.1GB. [2022-07-19 22:24:11,882 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 90.2MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:24:11,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 726.32ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 49.8MB in the beginning and 52.0MB in the end (delta: -2.2MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. [2022-07-19 22:24:11,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.86ms. Allocated memory is still 109.1MB. Free memory was 52.0MB in the beginning and 46.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 22:24:11,882 INFO L158 Benchmark]: Boogie Preprocessor took 122.25ms. Allocated memory is still 109.1MB. Free memory was 46.9MB in the beginning and 70.2MB in the end (delta: -23.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2022-07-19 22:24:11,883 INFO L158 Benchmark]: RCFGBuilder took 1046.91ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 70.2MB in the beginning and 83.2MB in the end (delta: -13.0MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. [2022-07-19 22:24:11,883 INFO L158 Benchmark]: TraceAbstraction took 50726.96ms. Allocated memory was 138.4MB in the beginning and 744.5MB in the end (delta: 606.1MB). Free memory was 83.2MB in the beginning and 622.2MB in the end (delta: -539.0MB). Peak memory consumption was 460.1MB. Max. memory is 16.1GB. [2022-07-19 22:24:11,883 INFO L158 Benchmark]: Witness Printer took 116.56ms. Allocated memory is still 744.5MB. Free memory was 622.2MB in the beginning and 603.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-19 22:24:11,884 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.86ms. Allocated memory is still 90.2MB. Free memory was 60.4MB in the beginning and 60.4MB in the end (delta: 28.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 726.32ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 49.8MB in the beginning and 52.0MB in the end (delta: -2.2MB). Peak memory consumption was 20.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.86ms. Allocated memory is still 109.1MB. Free memory was 52.0MB in the beginning and 46.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 122.25ms. Allocated memory is still 109.1MB. Free memory was 46.9MB in the beginning and 70.2MB in the end (delta: -23.3MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1046.91ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 70.2MB in the beginning and 83.2MB in the end (delta: -13.0MB). Peak memory consumption was 46.6MB. Max. memory is 16.1GB. * TraceAbstraction took 50726.96ms. Allocated memory was 138.4MB in the beginning and 744.5MB in the end (delta: 606.1MB). Free memory was 83.2MB in the beginning and 622.2MB in the end (delta: -539.0MB). Peak memory consumption was 460.1MB. Max. memory is 16.1GB. * Witness Printer took 116.56ms. Allocated memory is still 744.5MB. Free memory was 622.2MB in the beginning and 603.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 164 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.6s, OverallIterations: 23, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 25.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2904 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2802 mSDsluCounter, 19734 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 14724 mSDsCounter, 481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2008 IncrementalHoareTripleChecker+Invalid, 2727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 481 mSolverCounterUnsat, 5010 mSDtfsCounter, 2008 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3038 GetRequests, 2742 SyntacticMatches, 8 SemanticMatches, 288 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1210occurred in iteration=13, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 1456 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 81 LocationsWithAnnotation, 3470 PreInvPairs, 3685 NumberOfFragments, 1942 HoareAnnotationTreeSize, 3470 FomulaSimplifications, 377649 FormulaSimplificationTreeSizeReduction, 16.3s HoareSimplificationTime, 81 FomulaSimplificationsInter, 268966 FormulaSimplificationTreeSizeReductionInter, 9.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 4605 NumberOfCodeBlocks, 4503 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4671 ConstructedInterpolants, 8 QuantifiedInterpolants, 9786 SizeOfPredicates, 86 NumberOfNonLiveVariables, 27912 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 42 InterpolantComputations, 23 PerfectInterpolantSequences, 1329/1543 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: (!(ldv_urb_state == 0) || ((ldv_coherent_state == 1 && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1) - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3793]: Loop Invariant [2022-07-19 22:24:11,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,892 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,893 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((!(error == 0) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) || (((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: (((!(ldv_urb_state == 0) || ((((addr == 0 && 1 <= ldv_coherent_state) && addr == 0) && addr == addr) && addr == addr)) || !(\old(ldv_coherent_state) == 1)) || ((ldv_coherent_state == 0 && addr == addr) && addr == addr)) && (((!((addr + addr) % 18446744073709551616 == 0) || !(ldv_urb_state == 0)) || !(0 == res_kbtab_probe_3)) || !(\old(ldv_coherent_state) == 1)) - InvariantResult [Line: 3875]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0 - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: (((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4129]: Loop Invariant [2022-07-19 22:24:11,894 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,895 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0)) || (((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3)) - InvariantResult [Line: 4124]: Loop Invariant [2022-07-19 22:24:11,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:24:11,896 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:24:11,897 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: ((((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && !(arbitrary_memory == 0)) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && arbitrary_memory == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0)) && 0 == res_kbtab_probe_3) && ldv_coherent_state == 1) && ldv_urb_state == 1) || (((((((((arbitrary_memory == 0 && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && (!(#memory_$Pointer$[kbtab][kbtab] == 0) || !(#memory_$Pointer$[kbtab][kbtab] == 0))) && error + 12 <= 0) && 0 == \result) - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ((!(1 == \old(ldv_urb_state)) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3)) || (ldv_urb_state == 0 && !((urb + urb) % 18446744073709551616 == 0)) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && arbitrary_memory == 0) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: ((ldv_urb_state == 1 || !(1 == \old(ldv_urb_state))) || !(ldv_coherent_state == 1)) || !(0 == res_kbtab_probe_3) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: ((((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: ((((((((arbitrary_memory == 0 && 0 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && 0 <= ldv_urb_state) && !(ldv_s_kbtab_driver_usb_driver == 1)) || (((((arbitrary_memory == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state == 1) && ldv_urb_state == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) RESULT: Ultimate proved your program to be correct! [2022-07-19 22:24:11,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE