./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:38:26,619 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:38:26,621 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:38:26,658 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:38:26,658 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:38:26,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:38:26,661 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:38:26,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:38:26,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:38:26,667 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:38:26,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:38:26,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:38:26,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:38:26,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:38:26,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:38:26,675 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:38:26,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:38:26,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:38:26,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:38:26,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:38:26,683 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:38:26,684 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:38:26,684 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:38:26,685 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:38:26,686 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:38:26,691 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:38:26,692 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:38:26,692 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:38:26,693 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:38:26,693 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:38:26,694 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:38:26,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:38:26,695 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:38:26,696 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:38:26,697 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:38:26,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:38:26,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:38:26,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:38:26,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:38:26,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:38:26,699 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:38:26,700 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:38:26,701 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-22 22:38:26,728 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:38:26,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:38:26,729 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:38:26,729 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:38:26,729 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:38:26,730 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:38:26,730 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:38:26,730 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:38:26,730 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:38:26,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:38:26,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 22:38:26,732 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:38:26,732 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:38:26,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:38:26,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:38:26,733 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:38:26,733 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:38:26,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:38:26,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:38:26,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:38:26,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:38:26,734 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:38:26,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:38:26,734 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:38:26,734 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:38:26,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 22:38:26,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 22:38:26,735 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:38:26,735 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:38:26,735 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:38:26,735 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-07-22 22:38:26,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:38:26,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:38:26,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:38:26,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:38:26,961 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:38:26,962 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-22 22:38:27,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa453b47/f2ca393aeb334ccdbb92cff2dc729693/FLAG5deffcb8c [2022-07-22 22:38:27,561 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:38:27,562 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-22 22:38:27,597 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa453b47/f2ca393aeb334ccdbb92cff2dc729693/FLAG5deffcb8c [2022-07-22 22:38:28,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fa453b47/f2ca393aeb334ccdbb92cff2dc729693 [2022-07-22 22:38:28,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:38:28,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:38:28,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:38:28,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:38:28,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:38:28,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:38:28" (1/1) ... [2022-07-22 22:38:28,041 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f6c535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:28, skipping insertion in model container [2022-07-22 22:38:28,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:38:28" (1/1) ... [2022-07-22 22:38:28,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:38:28,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:38:29,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-22 22:38:29,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:38:29,116 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:38:29,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-22 22:38:29,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:38:29,582 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:38:29,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29 WrapperNode [2022-07-22 22:38:29,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:38:29,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:38:29,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:38:29,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:38:29,592 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,734 INFO L137 Inliner]: procedures = 142, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1679 [2022-07-22 22:38:29,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:38:29,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:38:29,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:38:29,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:38:29,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:38:29,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:38:29,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:38:29,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:38:29,888 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (1/1) ... [2022-07-22 22:38:29,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:38:29,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:29,913 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-22 22:38:29,930 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-22 22:38:29,963 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-22 22:38:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-22 22:38:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-22 22:38:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-22 22:38:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-22 22:38:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-22 22:38:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-22 22:38:29,964 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-22 22:38:29,964 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-22 22:38:29,965 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 22:38:29,965 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-22 22:38:29,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 22:38:29,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-22 22:38:29,965 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-22 22:38:29,965 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-22 22:38:29,965 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-22 22:38:29,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-22 22:38:29,965 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-22 22:38:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-22 22:38:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-22 22:38:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-22 22:38:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-22 22:38:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-22 22:38:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-22 22:38:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:38:29,966 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-22 22:38:29,966 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-22 22:38:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-22 22:38:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-22 22:38:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-22 22:38:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-22 22:38:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-22 22:38:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:38:29,967 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-22 22:38:29,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-22 22:38:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-22 22:38:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-22 22:38:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-22 22:38:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-22 22:38:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-22 22:38:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-22 22:38:29,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:38:29,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:38:30,372 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:38:30,380 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:38:31,019 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-22 22:38:31,072 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 22:38:31,079 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 22:38:31,839 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-22 22:38:31,839 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-22 22:38:31,839 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-22 22:38:31,839 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-22 22:38:31,865 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:38:31,876 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:38:31,877 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-22 22:38:31,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:38:31 BoogieIcfgContainer [2022-07-22 22:38:31,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:38:31,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:38:31,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:38:31,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:38:31,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:38:28" (1/3) ... [2022-07-22 22:38:31,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c35c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:38:31, skipping insertion in model container [2022-07-22 22:38:31,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:38:29" (2/3) ... [2022-07-22 22:38:31,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c35c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:38:31, skipping insertion in model container [2022-07-22 22:38:31,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:38:31" (3/3) ... [2022-07-22 22:38:31,887 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-22 22:38:31,899 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:38:31,900 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:38:31,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:38:31,972 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@a3f704e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f284a43 [2022-07-22 22:38:31,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:38:31,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 547 states, 388 states have (on average 1.3943298969072164) internal successors, (541), 401 states have internal predecessors, (541), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-07-22 22:38:31,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 22:38:31,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:31,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:38:31,985 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:31,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:31,989 INFO L85 PathProgramCache]: Analyzing trace with hash -701775118, now seen corresponding path program 1 times [2022-07-22 22:38:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:31,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362536089] [2022-07-22 22:38:31,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:32,486 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-22 22:38:32,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:32,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362536089] [2022-07-22 22:38:32,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362536089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:32,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:38:32,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:38:32,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360829999] [2022-07-22 22:38:32,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:32,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:38:32,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:38:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:38:32,525 INFO L87 Difference]: Start difference. First operand has 547 states, 388 states have (on average 1.3943298969072164) internal successors, (541), 401 states have internal predecessors, (541), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-22 22:38:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:32,688 INFO L93 Difference]: Finished difference Result 1092 states and 1610 transitions. [2022-07-22 22:38:32,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:38:32,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-22 22:38:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:32,703 INFO L225 Difference]: With dead ends: 1092 [2022-07-22 22:38:32,703 INFO L226 Difference]: Without dead ends: 548 [2022-07-22 22:38:32,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:38:32,716 INFO L413 NwaCegarLoop]: 719 mSDtfsCounter, 301 mSDsluCounter, 2471 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3190 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:32,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3190 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:38:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-22 22:38:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 543. [2022-07-22 22:38:32,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 386 states have (on average 1.217616580310881) internal successors, (470), 394 states have internal predecessors, (470), 121 states have call successors, (121), 35 states have call predecessors, (121), 35 states have return successors, (119), 118 states have call predecessors, (119), 118 states have call successors, (119) [2022-07-22 22:38:32,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 710 transitions. [2022-07-22 22:38:32,822 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 710 transitions. Word has length 17 [2022-07-22 22:38:32,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:32,822 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 710 transitions. [2022-07-22 22:38:32,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-22 22:38:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 710 transitions. [2022-07-22 22:38:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 22:38:32,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:32,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:38:32,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 22:38:32,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:32,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1094802128, now seen corresponding path program 1 times [2022-07-22 22:38:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:32,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159873284] [2022-07-22 22:38:32,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:32,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:32,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:32,938 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-22 22:38:32,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:32,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159873284] [2022-07-22 22:38:32,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159873284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:32,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:38:32,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:38:32,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071677470] [2022-07-22 22:38:32,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:32,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:38:32,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:32,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:38:32,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:38:32,942 INFO L87 Difference]: Start difference. First operand 543 states and 710 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 22:38:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:32,992 INFO L93 Difference]: Finished difference Result 1589 states and 2102 transitions. [2022-07-22 22:38:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:38:32,992 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-22 22:38:32,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:32,999 INFO L225 Difference]: With dead ends: 1589 [2022-07-22 22:38:32,999 INFO L226 Difference]: Without dead ends: 1064 [2022-07-22 22:38:33,002 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-22 22:38:33,003 INFO L413 NwaCegarLoop]: 993 mSDtfsCounter, 693 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 1679 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-22 22:38:33,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 1679 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:38:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-07-22 22:38:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1061. [2022-07-22 22:38:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 754 states have (on average 1.2175066312997347) internal successors, (918), 767 states have internal predecessors, (918), 238 states have call successors, (238), 68 states have call predecessors, (238), 68 states have return successors, (240), 234 states have call predecessors, (240), 235 states have call successors, (240) [2022-07-22 22:38:33,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1396 transitions. [2022-07-22 22:38:33,058 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1396 transitions. Word has length 17 [2022-07-22 22:38:33,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:33,058 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1396 transitions. [2022-07-22 22:38:33,059 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-22 22:38:33,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1396 transitions. [2022-07-22 22:38:33,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 22:38:33,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:33,060 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-22 22:38:33,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 22:38:33,060 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:33,061 INFO L85 PathProgramCache]: Analyzing trace with hash 420612946, now seen corresponding path program 1 times [2022-07-22 22:38:33,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:33,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334670722] [2022-07-22 22:38:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:33,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:33,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:33,166 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-22 22:38:33,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:33,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334670722] [2022-07-22 22:38:33,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334670722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:33,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:38:33,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:38:33,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241389543] [2022-07-22 22:38:33,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:33,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:38:33,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:33,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:38:33,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:38:33,170 INFO L87 Difference]: Start difference. First operand 1061 states and 1396 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-22 22:38:33,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:33,222 INFO L93 Difference]: Finished difference Result 1063 states and 1397 transitions. [2022-07-22 22:38:33,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:38:33,223 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-22 22:38:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:33,229 INFO L225 Difference]: With dead ends: 1063 [2022-07-22 22:38:33,229 INFO L226 Difference]: Without dead ends: 1052 [2022-07-22 22:38:33,234 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-22 22:38:33,237 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 695 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:33,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:38:33,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-22 22:38:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1047. [2022-07-22 22:38:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 744 states have (on average 1.2123655913978495) internal successors, (902), 755 states have internal predecessors, (902), 236 states have call successors, (236), 67 states have call predecessors, (236), 66 states have return successors, (238), 232 states have call predecessors, (238), 234 states have call successors, (238) [2022-07-22 22:38:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1376 transitions. [2022-07-22 22:38:33,297 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1376 transitions. Word has length 18 [2022-07-22 22:38:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:33,298 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1376 transitions. [2022-07-22 22:38:33,298 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-22 22:38:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1376 transitions. [2022-07-22 22:38:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 22:38:33,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:33,311 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] [2022-07-22 22:38:33,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 22:38:33,311 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:33,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:33,312 INFO L85 PathProgramCache]: Analyzing trace with hash -42685748, now seen corresponding path program 1 times [2022-07-22 22:38:33,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:33,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996128171] [2022-07-22 22:38:33,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:33,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:33,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:33,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-22 22:38:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:33,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-22 22:38:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:33,491 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-22 22:38:33,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:33,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996128171] [2022-07-22 22:38:33,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996128171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:33,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:38:33,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:38:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397398656] [2022-07-22 22:38:33,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:33,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:38:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:38:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:38:33,494 INFO L87 Difference]: Start difference. First operand 1047 states and 1376 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:38:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:34,545 INFO L93 Difference]: Finished difference Result 2403 states and 3232 transitions. [2022-07-22 22:38:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:38:34,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-07-22 22:38:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:34,553 INFO L225 Difference]: With dead ends: 2403 [2022-07-22 22:38:34,553 INFO L226 Difference]: Without dead ends: 1368 [2022-07-22 22:38:34,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:38:34,557 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 427 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:34,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 1358 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 22:38:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-07-22 22:38:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1346. [2022-07-22 22:38:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 961 states have (on average 1.2341311134235171) internal successors, (1186), 980 states have internal predecessors, (1186), 318 states have call successors, (318), 67 states have call predecessors, (318), 66 states have return successors, (320), 312 states have call predecessors, (320), 316 states have call successors, (320) [2022-07-22 22:38:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1824 transitions. [2022-07-22 22:38:34,608 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1824 transitions. Word has length 50 [2022-07-22 22:38:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:34,609 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1824 transitions. [2022-07-22 22:38:34,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:38:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1824 transitions. [2022-07-22 22:38:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 22:38:34,612 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:34,612 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 22:38:34,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 22:38:34,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1108217249, now seen corresponding path program 1 times [2022-07-22 22:38:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:34,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467387480] [2022-07-22 22:38:34,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:34,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:34,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-22 22:38:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:34,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:38:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:34,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-22 22:38:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:38:34,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:34,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467387480] [2022-07-22 22:38:34,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467387480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:34,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:38:34,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 22:38:34,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043674787] [2022-07-22 22:38:34,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:34,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 22:38:34,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:34,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 22:38:34,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:38:34,735 INFO L87 Difference]: Start difference. First operand 1346 states and 1824 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 22:38:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:35,880 INFO L93 Difference]: Finished difference Result 2719 states and 3690 transitions. [2022-07-22 22:38:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:38:35,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-07-22 22:38:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:35,887 INFO L225 Difference]: With dead ends: 2719 [2022-07-22 22:38:35,887 INFO L226 Difference]: Without dead ends: 1374 [2022-07-22 22:38:35,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:38:35,892 INFO L413 NwaCegarLoop]: 682 mSDtfsCounter, 183 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:35,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 1801 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-22 22:38:35,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-22 22:38:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1346. [2022-07-22 22:38:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 961 states have (on average 1.2320499479708638) internal successors, (1184), 982 states have internal predecessors, (1184), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-07-22 22:38:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1818 transitions. [2022-07-22 22:38:35,945 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1818 transitions. Word has length 72 [2022-07-22 22:38:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:35,945 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1818 transitions. [2022-07-22 22:38:35,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 22:38:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1818 transitions. [2022-07-22 22:38:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-22 22:38:35,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:35,947 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 22:38:35,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 22:38:35,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:35,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:35,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1223480200, now seen corresponding path program 1 times [2022-07-22 22:38:35,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:35,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620722191] [2022-07-22 22:38:35,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:35,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:38:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:38:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:38:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:38:36,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:38:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:38:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:38:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:36,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:38:36,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:38:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-22 22:38:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620722191] [2022-07-22 22:38:36,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620722191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:36,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859918731] [2022-07-22 22:38:36,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:36,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:36,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:36,203 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-22 22:38:36,232 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-22 22:38:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:36,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:38:36,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:36,784 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 19 treesize of output 7 [2022-07-22 22:38:36,800 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 19 treesize of output 7 [2022-07-22 22:38:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-22 22:38:36,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:38:36,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859918731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:36,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:38:36,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-22 22:38:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237650441] [2022-07-22 22:38:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:36,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:38:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:36,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:38:36,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-22 22:38:36,869 INFO L87 Difference]: Start difference. First operand 1346 states and 1818 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-22 22:38:37,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:37,852 INFO L93 Difference]: Finished difference Result 1408 states and 1898 transitions. [2022-07-22 22:38:37,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:38:37,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 146 [2022-07-22 22:38:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:37,859 INFO L225 Difference]: With dead ends: 1408 [2022-07-22 22:38:37,859 INFO L226 Difference]: Without dead ends: 1348 [2022-07-22 22:38:37,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:38:37,864 INFO L413 NwaCegarLoop]: 697 mSDtfsCounter, 4 mSDsluCounter, 3226 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:37,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3923 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 22:38:37,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2022-07-22 22:38:37,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1346. [2022-07-22 22:38:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 961 states have (on average 1.2299687825182102) internal successors, (1182), 982 states have internal predecessors, (1182), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-07-22 22:38:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1816 transitions. [2022-07-22 22:38:37,907 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1816 transitions. Word has length 146 [2022-07-22 22:38:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:37,908 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1816 transitions. [2022-07-22 22:38:37,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-22 22:38:37,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1816 transitions. [2022-07-22 22:38:37,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:38:37,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:37,910 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:38:37,937 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-22 22:38:38,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-22 22:38:38,128 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:38,128 INFO L85 PathProgramCache]: Analyzing trace with hash 193202081, now seen corresponding path program 1 times [2022-07-22 22:38:38,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:38,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931189642] [2022-07-22 22:38:38,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:38,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:38:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:38:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:38:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:38:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:38:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:38:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:38:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:38:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:38,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:38:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-22 22:38:38,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:38,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931189642] [2022-07-22 22:38:38,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931189642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:38,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013689932] [2022-07-22 22:38:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:38,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:38,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:38,389 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-22 22:38:38,390 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-22 22:38:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:38,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 22:38:38,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-22 22:38:38,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:38:38,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013689932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:38:38,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:38:38,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-22 22:38:38,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417582977] [2022-07-22 22:38:38,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:38,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:38:38,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:38,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:38:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:38:38,866 INFO L87 Difference]: Start difference. First operand 1346 states and 1816 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:38:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:38,943 INFO L93 Difference]: Finished difference Result 2703 states and 3651 transitions. [2022-07-22 22:38:38,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:38:38,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 147 [2022-07-22 22:38:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:38,949 INFO L225 Difference]: With dead ends: 2703 [2022-07-22 22:38:38,949 INFO L226 Difference]: Without dead ends: 1367 [2022-07-22 22:38:38,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 182 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:38:38,953 INFO L413 NwaCegarLoop]: 711 mSDtfsCounter, 13 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:38,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3524 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:38:38,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-22 22:38:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1353. [2022-07-22 22:38:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 966 states have (on average 1.2287784679089027) internal successors, (1187), 988 states have internal predecessors, (1187), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-07-22 22:38:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1826 transitions. [2022-07-22 22:38:38,983 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1826 transitions. Word has length 147 [2022-07-22 22:38:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:38,984 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1826 transitions. [2022-07-22 22:38:38,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:38:38,984 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1826 transitions. [2022-07-22 22:38:38,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:38:38,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:38,986 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 22:38:39,021 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-22 22:38:39,203 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,SelfDestructingSolverStorable6 [2022-07-22 22:38:39,203 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2120603136, now seen corresponding path program 1 times [2022-07-22 22:38:39,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393740015] [2022-07-22 22:38:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:39,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:39,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:38:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:38:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:38:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:38:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:38:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:38:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:38:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:38:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:38:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,529 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-22 22:38:39,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:39,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393740015] [2022-07-22 22:38:39,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393740015] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:39,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99956621] [2022-07-22 22:38:39,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:39,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:39,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:39,548 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-22 22:38:39,549 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-22 22:38:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:39,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-22 22:38:39,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:40,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:38:40,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:38:40,140 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 22:38:40,140 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 23 treesize of output 22 [2022-07-22 22:38:40,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,145 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 23 treesize of output 22 [2022-07-22 22:38:40,283 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 22:38:40,284 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 23 treesize of output 22 [2022-07-22 22:38:40,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,290 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 23 treesize of output 22 [2022-07-22 22:38:40,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-22 22:38:40,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:40,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-22 22:38:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 22:38:40,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:38:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-22 22:38:40,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99956621] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:38:40,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:38:40,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2022-07-22 22:38:40,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340411299] [2022-07-22 22:38:40,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:38:40,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-22 22:38:40,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:40,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-22 22:38:40,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-07-22 22:38:40,885 INFO L87 Difference]: Start difference. First operand 1353 states and 1826 transitions. Second operand has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-22 22:38:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:44,851 INFO L93 Difference]: Finished difference Result 2464 states and 3330 transitions. [2022-07-22 22:38:44,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-22 22:38:44,852 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) Word has length 147 [2022-07-22 22:38:44,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:44,857 INFO L225 Difference]: With dead ends: 2464 [2022-07-22 22:38:44,857 INFO L226 Difference]: Without dead ends: 1032 [2022-07-22 22:38:44,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-07-22 22:38:44,861 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 170 mSDsluCounter, 3782 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 4486 SdHoareTripleChecker+Invalid, 3027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:44,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 4486 Invalid, 3027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2473 Invalid, 0 Unknown, 422 Unchecked, 3.8s Time] [2022-07-22 22:38:44,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-07-22 22:38:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1016. [2022-07-22 22:38:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 725 states have (on average 1.226206896551724) internal successors, (889), 742 states have internal predecessors, (889), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 221 states have call predecessors, (231), 224 states have call successors, (231) [2022-07-22 22:38:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1346 transitions. [2022-07-22 22:38:44,889 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1346 transitions. Word has length 147 [2022-07-22 22:38:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:44,890 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 1346 transitions. [2022-07-22 22:38:44,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.833333333333333) internal successors, (105), 14 states have internal predecessors, (105), 8 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (23), 8 states have call predecessors, (23), 7 states have call successors, (23) [2022-07-22 22:38:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1346 transitions. [2022-07-22 22:38:44,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:38:44,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:44,892 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2022-07-22 22:38:44,925 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-22 22:38:45,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:45,112 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:45,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash -339103201, now seen corresponding path program 1 times [2022-07-22 22:38:45,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:45,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288440181] [2022-07-22 22:38:45,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:45,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:38:45,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:38:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:38:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:38:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:38:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:38:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:38:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:38:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:45,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:38:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-22 22:38:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:45,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288440181] [2022-07-22 22:38:45,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288440181] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:45,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020553589] [2022-07-22 22:38:45,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:45,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:45,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:45,492 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-22 22:38:45,500 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-22 22:38:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:45,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 22:38:45,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-22 22:38:46,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:38:46,358 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-22 22:38:46,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020553589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:38:46,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:38:46,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2022-07-22 22:38:46,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773818489] [2022-07-22 22:38:46,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:38:46,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-22 22:38:46,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:46,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 22:38:46,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-22 22:38:46,361 INFO L87 Difference]: Start difference. First operand 1016 states and 1346 transitions. Second operand has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) [2022-07-22 22:38:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:51,289 INFO L93 Difference]: Finished difference Result 2099 states and 2804 transitions. [2022-07-22 22:38:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-22 22:38:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) Word has length 147 [2022-07-22 22:38:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:51,294 INFO L225 Difference]: With dead ends: 2099 [2022-07-22 22:38:51,295 INFO L226 Difference]: Without dead ends: 1397 [2022-07-22 22:38:51,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 22:38:51,299 INFO L413 NwaCegarLoop]: 925 mSDtfsCounter, 2183 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 4158 mSolverCounterSat, 1108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 4970 SdHoareTripleChecker+Invalid, 5266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1108 IncrementalHoareTripleChecker+Valid, 4158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:51,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 4970 Invalid, 5266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1108 Valid, 4158 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-22 22:38:51,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-07-22 22:38:51,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1372. [2022-07-22 22:38:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 975 states have (on average 1.2225641025641025) internal successors, (1192), 997 states have internal predecessors, (1192), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 297 states have call predecessors, (329), 300 states have call successors, (329) [2022-07-22 22:38:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1823 transitions. [2022-07-22 22:38:51,336 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1823 transitions. Word has length 147 [2022-07-22 22:38:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:51,337 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1823 transitions. [2022-07-22 22:38:51,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.875) internal successors, (158), 12 states have internal predecessors, (158), 8 states have call successors, (42), 9 states have call predecessors, (42), 9 states have return successors, (41), 9 states have call predecessors, (41), 8 states have call successors, (41) [2022-07-22 22:38:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1823 transitions. [2022-07-22 22:38:51,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-22 22:38:51,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:51,339 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-22 22:38:51,377 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-22 22:38:51,559 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-22 22:38:51,560 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:51,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:51,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1013490977, now seen corresponding path program 1 times [2022-07-22 22:38:51,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:51,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314186970] [2022-07-22 22:38:51,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:51,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:38:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:38:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:38:51,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:38:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:38:51,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:38:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:38:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:38:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:38:51,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-22 22:38:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:51,812 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-22 22:38:51,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:51,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314186970] [2022-07-22 22:38:51,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314186970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:51,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123214223] [2022-07-22 22:38:51,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:51,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:51,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:51,828 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-22 22:38:51,829 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-22 22:38:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:52,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:38:52,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:52,343 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 19 treesize of output 7 [2022-07-22 22:38:52,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 22:38:52,353 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-22 22:38:52,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:38:52,424 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-22 22:38:52,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123214223] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:52,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:38:52,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-22 22:38:52,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324247062] [2022-07-22 22:38:52,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:38:52,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:38:52,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:52,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:38:52,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:38:52,425 INFO L87 Difference]: Start difference. First operand 1372 states and 1823 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 22:38:53,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:53,577 INFO L93 Difference]: Finished difference Result 1437 states and 1901 transitions. [2022-07-22 22:38:53,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:38:53,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 157 [2022-07-22 22:38:53,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:53,594 INFO L225 Difference]: With dead ends: 1437 [2022-07-22 22:38:53,595 INFO L226 Difference]: Without dead ends: 1372 [2022-07-22 22:38:53,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:38:53,597 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 5 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:53,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3923 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-22 22:38:53,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-07-22 22:38:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2022-07-22 22:38:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 975 states have (on average 1.2215384615384615) internal successors, (1191), 997 states have internal predecessors, (1191), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 297 states have call predecessors, (329), 300 states have call successors, (329) [2022-07-22 22:38:53,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1822 transitions. [2022-07-22 22:38:53,675 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1822 transitions. Word has length 157 [2022-07-22 22:38:53,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:53,676 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1822 transitions. [2022-07-22 22:38:53,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 4 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-22 22:38:53,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1822 transitions. [2022-07-22 22:38:53,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-22 22:38:53,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:53,679 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-22 22:38:53,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-22 22:38:53,896 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-22 22:38:53,896 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:53,897 INFO L85 PathProgramCache]: Analyzing trace with hash -497932717, now seen corresponding path program 1 times [2022-07-22 22:38:53,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:53,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283783925] [2022-07-22 22:38:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:53,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:38:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:38:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:38:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:38:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:38:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:38:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:38:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:38:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:38:54,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:54,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-22 22:38:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-22 22:38:54,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:54,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283783925] [2022-07-22 22:38:54,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283783925] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:54,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808170526] [2022-07-22 22:38:54,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:54,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:54,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:54,156 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-22 22:38:54,157 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-22 22:38:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:54,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-22 22:38:54,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:54,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:38:54,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:38:54,730 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 22:38:54,730 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 23 treesize of output 22 [2022-07-22 22:38:54,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:54,734 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 23 treesize of output 22 [2022-07-22 22:38:54,908 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 22:38:54,908 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 23 treesize of output 22 [2022-07-22 22:38:54,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:38:54,914 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 23 treesize of output 22 [2022-07-22 22:38:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-22 22:38:54,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:38:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-22 22:38:55,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808170526] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:38:55,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:38:55,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-07-22 22:38:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335000479] [2022-07-22 22:38:55,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:38:55,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 22:38:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:38:55,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 22:38:55,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:38:55,181 INFO L87 Difference]: Start difference. First operand 1372 states and 1822 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-22 22:38:58,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:38:58,633 INFO L93 Difference]: Finished difference Result 2452 states and 3275 transitions. [2022-07-22 22:38:58,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-22 22:38:58,634 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) Word has length 158 [2022-07-22 22:38:58,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:38:58,639 INFO L225 Difference]: With dead ends: 2452 [2022-07-22 22:38:58,639 INFO L226 Difference]: Without dead ends: 1374 [2022-07-22 22:38:58,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 342 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:38:58,642 INFO L413 NwaCegarLoop]: 691 mSDtfsCounter, 173 mSDsluCounter, 3388 mSDsCounter, 0 mSdLazyCounter, 2510 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 4079 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:38:58,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 4079 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2510 Invalid, 0 Unknown, 415 Unchecked, 3.3s Time] [2022-07-22 22:38:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-22 22:38:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1372. [2022-07-22 22:38:58,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1372 states, 975 states have (on average 1.2215384615384615) internal successors, (1191), 997 states have internal predecessors, (1191), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (328), 297 states have call predecessors, (328), 300 states have call successors, (328) [2022-07-22 22:38:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1821 transitions. [2022-07-22 22:38:58,676 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1821 transitions. Word has length 158 [2022-07-22 22:38:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:38:58,676 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1821 transitions. [2022-07-22 22:38:58,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 12 states have internal predecessors, (109), 6 states have call successors, (29), 6 states have call predecessors, (29), 5 states have return successors, (21), 7 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-22 22:38:58,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1821 transitions. [2022-07-22 22:38:58,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-22 22:38:58,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:38:58,678 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:38:58,716 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-22 22:38:58,899 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-22 22:38:58,899 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:38:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:38:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash 865652627, now seen corresponding path program 1 times [2022-07-22 22:38:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:38:58,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007441803] [2022-07-22 22:38:58,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:58,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:38:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:38:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:38:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:38:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:38:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:38:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:38:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:38:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:38:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:38:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:59,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:38:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:38:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:38:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:38:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-22 22:38:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2022-07-22 22:38:59,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:38:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007441803] [2022-07-22 22:38:59,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007441803] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:38:59,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19119495] [2022-07-22 22:38:59,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:38:59,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:38:59,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:38:59,200 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-22 22:38:59,201 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-22 22:38:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:38:59,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 1961 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 22:38:59,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:38:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-07-22 22:38:59,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:39:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-07-22 22:39:00,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19119495] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:39:00,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:39:00,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 11] total 22 [2022-07-22 22:39:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371729500] [2022-07-22 22:39:00,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:39:00,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-22 22:39:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:00,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-22 22:39:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:39:00,154 INFO L87 Difference]: Start difference. First operand 1372 states and 1821 transitions. Second operand has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 17 states have internal predecessors, (188), 10 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (45), 11 states have call predecessors, (45), 10 states have call successors, (45) [2022-07-22 22:39:06,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:06,080 INFO L93 Difference]: Finished difference Result 2837 states and 3755 transitions. [2022-07-22 22:39:06,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 22:39:06,081 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 17 states have internal predecessors, (188), 10 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (45), 11 states have call predecessors, (45), 10 states have call successors, (45) Word has length 158 [2022-07-22 22:39:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:06,087 INFO L225 Difference]: With dead ends: 2837 [2022-07-22 22:39:06,087 INFO L226 Difference]: Without dead ends: 1782 [2022-07-22 22:39:06,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=415, Invalid=1565, Unknown=0, NotChecked=0, Total=1980 [2022-07-22 22:39:06,091 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 2605 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 5661 mSolverCounterSat, 1381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2789 SdHoareTripleChecker+Valid, 5841 SdHoareTripleChecker+Invalid, 7042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1381 IncrementalHoareTripleChecker+Valid, 5661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:06,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2789 Valid, 5841 Invalid, 7042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1381 Valid, 5661 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-22 22:39:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-07-22 22:39:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2022-07-22 22:39:06,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1229 states have (on average 1.2188771358828316) internal successors, (1498), 1259 states have internal predecessors, (1498), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (411), 370 states have call predecessors, (411), 376 states have call successors, (411) [2022-07-22 22:39:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2287 transitions. [2022-07-22 22:39:06,177 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2287 transitions. Word has length 158 [2022-07-22 22:39:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:06,179 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2287 transitions. [2022-07-22 22:39:06,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.545454545454545) internal successors, (188), 17 states have internal predecessors, (188), 10 states have call successors, (46), 11 states have call predecessors, (46), 12 states have return successors, (45), 11 states have call predecessors, (45), 10 states have call successors, (45) [2022-07-22 22:39:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2287 transitions. [2022-07-22 22:39:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-22 22:39:06,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:06,182 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:39:06,217 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-22 22:39:06,391 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-22 22:39:06,391 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2103165584, now seen corresponding path program 1 times [2022-07-22 22:39:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:06,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5287457] [2022-07-22 22:39:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:06,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:06,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:06,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-22 22:39:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-22 22:39:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-22 22:39:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:06,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5287457] [2022-07-22 22:39:06,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5287457] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:39:06,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570840496] [2022-07-22 22:39:06,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:06,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:39:06,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:39:06,667 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-22 22:39:06,739 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-22 22:39:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:07,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:39:07,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:39:07,342 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 19 treesize of output 7 [2022-07-22 22:39:07,345 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 19 treesize of output 7 [2022-07-22 22:39:07,355 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-22 22:39:07,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:39:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-22 22:39:07,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570840496] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 22:39:07,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:39:07,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-22 22:39:07,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592289334] [2022-07-22 22:39:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:39:07,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:39:07,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:07,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:39:07,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:39:07,463 INFO L87 Difference]: Start difference. First operand 1735 states and 2287 transitions. Second operand has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:39:08,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:08,408 INFO L93 Difference]: Finished difference Result 1822 states and 2390 transitions. [2022-07-22 22:39:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:39:08,409 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2022-07-22 22:39:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:08,414 INFO L225 Difference]: With dead ends: 1822 [2022-07-22 22:39:08,414 INFO L226 Difference]: Without dead ends: 1735 [2022-07-22 22:39:08,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 370 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:39:08,416 INFO L413 NwaCegarLoop]: 701 mSDtfsCounter, 6 mSDsluCounter, 3230 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3931 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:08,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3931 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 22:39:08,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-22 22:39:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-22 22:39:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1229 states have (on average 1.2180634662327094) internal successors, (1497), 1259 states have internal predecessors, (1497), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (411), 370 states have call predecessors, (411), 376 states have call successors, (411) [2022-07-22 22:39:08,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2286 transitions. [2022-07-22 22:39:08,456 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2286 transitions. Word has length 168 [2022-07-22 22:39:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:08,456 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2286 transitions. [2022-07-22 22:39:08,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:39:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2286 transitions. [2022-07-22 22:39:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-22 22:39:08,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:08,458 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:39:08,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-22 22:39:08,673 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-22 22:39:08,674 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:08,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:08,674 INFO L85 PathProgramCache]: Analyzing trace with hash -332857001, now seen corresponding path program 1 times [2022-07-22 22:39:08,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:08,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237370678] [2022-07-22 22:39:08,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:08,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:08,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:08,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 22:39:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-22 22:39:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-22 22:39:08,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237370678] [2022-07-22 22:39:08,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237370678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:39:08,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778211503] [2022-07-22 22:39:08,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:08,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:39:08,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:39:08,947 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-22 22:39:08,963 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-22 22:39:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:09,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-22 22:39:09,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:39:09,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:39:09,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:39:09,625 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 22:39:09,627 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 23 treesize of output 22 [2022-07-22 22:39:09,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:39:09,636 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 23 treesize of output 22 [2022-07-22 22:39:09,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:39:09,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 10 [2022-07-22 22:39:09,994 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 22:39:09,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 10 [2022-07-22 22:39:10,056 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 8 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-22 22:39:10,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:39:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-22 22:39:10,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778211503] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:39:10,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:39:10,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 17 [2022-07-22 22:39:10,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251906762] [2022-07-22 22:39:10,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:39:10,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-22 22:39:10,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:10,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 22:39:10,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:39:10,216 INFO L87 Difference]: Start difference. First operand 1735 states and 2286 transitions. Second operand has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-22 22:39:12,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:12,768 INFO L93 Difference]: Finished difference Result 3174 states and 4193 transitions. [2022-07-22 22:39:12,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-22 22:39:12,768 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) Word has length 169 [2022-07-22 22:39:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:12,776 INFO L225 Difference]: With dead ends: 3174 [2022-07-22 22:39:12,776 INFO L226 Difference]: Without dead ends: 1735 [2022-07-22 22:39:12,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 365 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-22 22:39:12,783 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 177 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 4719 SdHoareTripleChecker+Invalid, 3152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 795 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:12,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 4719 Invalid, 3152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2225 Invalid, 0 Unknown, 795 Unchecked, 2.4s Time] [2022-07-22 22:39:12,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-22 22:39:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-22 22:39:12,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1229 states have (on average 1.2180634662327094) internal successors, (1497), 1259 states have internal predecessors, (1497), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (410), 370 states have call predecessors, (410), 376 states have call successors, (410) [2022-07-22 22:39:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2285 transitions. [2022-07-22 22:39:12,845 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2285 transitions. Word has length 169 [2022-07-22 22:39:12,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:12,846 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2285 transitions. [2022-07-22 22:39:12,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 7.6875) internal successors, (123), 11 states have internal predecessors, (123), 7 states have call successors, (32), 8 states have call predecessors, (32), 5 states have return successors, (23), 7 states have call predecessors, (23), 6 states have call successors, (23) [2022-07-22 22:39:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2285 transitions. [2022-07-22 22:39:12,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-22 22:39:12,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:12,849 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:39:12,885 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-22 22:39:13,059 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-22 22:39:13,059 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:13,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1756471977, now seen corresponding path program 1 times [2022-07-22 22:39:13,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:13,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004044827] [2022-07-22 22:39:13,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:13,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:13,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:13,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 22:39:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-22 22:39:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:13,357 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-22 22:39:13,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:13,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004044827] [2022-07-22 22:39:13,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004044827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:39:13,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:39:13,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-22 22:39:13,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159823491] [2022-07-22 22:39:13,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:39:13,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-22 22:39:13,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:13,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-22 22:39:13,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:39:13,359 INFO L87 Difference]: Start difference. First operand 1735 states and 2285 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-22 22:39:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:17,784 INFO L93 Difference]: Finished difference Result 1826 states and 2397 transitions. [2022-07-22 22:39:17,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 22:39:17,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) Word has length 169 [2022-07-22 22:39:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:17,791 INFO L225 Difference]: With dead ends: 1826 [2022-07-22 22:39:17,791 INFO L226 Difference]: Without dead ends: 1748 [2022-07-22 22:39:17,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-07-22 22:39:17,796 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 502 mSDsluCounter, 4211 mSDsCounter, 0 mSdLazyCounter, 3160 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 4901 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 3160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:17,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 4901 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 3160 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-22 22:39:17,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-07-22 22:39:17,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1740. [2022-07-22 22:39:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1234 states have (on average 1.2171799027552674) internal successors, (1502), 1263 states have internal predecessors, (1502), 378 states have call successors, (378), 124 states have call predecessors, (378), 127 states have return successors, (410), 371 states have call predecessors, (410), 376 states have call successors, (410) [2022-07-22 22:39:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2290 transitions. [2022-07-22 22:39:17,845 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2290 transitions. Word has length 169 [2022-07-22 22:39:17,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:17,845 INFO L495 AbstractCegarLoop]: Abstraction has 1740 states and 2290 transitions. [2022-07-22 22:39:17,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 8 states have internal predecessors, (88), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (17), 5 states have call predecessors, (17), 3 states have call successors, (17) [2022-07-22 22:39:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2290 transitions. [2022-07-22 22:39:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-22 22:39:17,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:17,847 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:39:17,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-22 22:39:17,847 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1061543817, now seen corresponding path program 2 times [2022-07-22 22:39:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:17,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892409658] [2022-07-22 22:39:17,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:17,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:17,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:17,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:17,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:17,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 22:39:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-22 22:39:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-22 22:39:18,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:18,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892409658] [2022-07-22 22:39:18,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892409658] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:39:18,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153949218] [2022-07-22 22:39:18,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:39:18,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:39:18,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:39:18,168 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-22 22:39:18,194 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-22 22:39:18,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 22:39:18,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:39:18,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 1980 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:39:18,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:39:18,895 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-07-22 22:39:18,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:39:19,222 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-22 22:39:19,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153949218] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:39:19,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 22:39:19,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 15] total 24 [2022-07-22 22:39:19,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307312650] [2022-07-22 22:39:19,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 22:39:19,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-22 22:39:19,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:19,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 22:39:19,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-07-22 22:39:19,227 INFO L87 Difference]: Start difference. First operand 1740 states and 2290 transitions. Second operand has 24 states, 24 states have (on average 7.75) internal successors, (186), 22 states have internal predecessors, (186), 15 states have call successors, (50), 12 states have call predecessors, (50), 13 states have return successors, (44), 13 states have call predecessors, (44), 14 states have call successors, (44) [2022-07-22 22:39:25,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:25,119 INFO L93 Difference]: Finished difference Result 2197 states and 2842 transitions. [2022-07-22 22:39:25,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 22:39:25,120 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 7.75) internal successors, (186), 22 states have internal predecessors, (186), 15 states have call successors, (50), 12 states have call predecessors, (50), 13 states have return successors, (44), 13 states have call predecessors, (44), 14 states have call successors, (44) Word has length 169 [2022-07-22 22:39:25,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:25,138 INFO L225 Difference]: With dead ends: 2197 [2022-07-22 22:39:25,138 INFO L226 Difference]: Without dead ends: 2185 [2022-07-22 22:39:25,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=442, Invalid=1118, Unknown=0, NotChecked=0, Total=1560 [2022-07-22 22:39:25,140 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 6428 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 4921 mSolverCounterSat, 2976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6706 SdHoareTripleChecker+Valid, 4531 SdHoareTripleChecker+Invalid, 7897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2976 IncrementalHoareTripleChecker+Valid, 4921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:25,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6706 Valid, 4531 Invalid, 7897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2976 Valid, 4921 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-22 22:39:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-07-22 22:39:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2105. [2022-07-22 22:39:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2105 states, 1491 states have (on average 1.215962441314554) internal successors, (1813), 1527 states have internal predecessors, (1813), 452 states have call successors, (452), 156 states have call predecessors, (452), 161 states have return successors, (488), 444 states have call predecessors, (488), 450 states have call successors, (488) [2022-07-22 22:39:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2753 transitions. [2022-07-22 22:39:25,263 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2753 transitions. Word has length 169 [2022-07-22 22:39:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:25,264 INFO L495 AbstractCegarLoop]: Abstraction has 2105 states and 2753 transitions. [2022-07-22 22:39:25,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 7.75) internal successors, (186), 22 states have internal predecessors, (186), 15 states have call successors, (50), 12 states have call predecessors, (50), 13 states have return successors, (44), 13 states have call predecessors, (44), 14 states have call successors, (44) [2022-07-22 22:39:25,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2753 transitions. [2022-07-22 22:39:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-22 22:39:25,266 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:25,266 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:39:25,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-22 22:39:25,476 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,SelfDestructingSolverStorable15 [2022-07-22 22:39:25,476 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:25,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:25,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1170991758, now seen corresponding path program 1 times [2022-07-22 22:39:25,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:25,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484088062] [2022-07-22 22:39:25,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:25,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:25,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 22:39:25,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-22 22:39:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-22 22:39:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-22 22:39:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:25,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484088062] [2022-07-22 22:39:25,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484088062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:39:25,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609722328] [2022-07-22 22:39:25,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:25,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:39:25,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:39:25,743 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-22 22:39:25,751 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-22 22:39:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:26,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-22 22:39:26,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:39:26,476 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 19 treesize of output 7 [2022-07-22 22:39:26,478 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 19 treesize of output 7 [2022-07-22 22:39:26,490 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-22 22:39:26,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:39:26,661 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2022-07-22 22:39:26,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609722328] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-22 22:39:26,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:39:26,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-22 22:39:26,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362694889] [2022-07-22 22:39:26,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:39:26,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:39:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:26,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:39:26,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-22 22:39:26,663 INFO L87 Difference]: Start difference. First operand 2105 states and 2753 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 22:39:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:27,668 INFO L93 Difference]: Finished difference Result 2171 states and 2812 transitions. [2022-07-22 22:39:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:39:27,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 179 [2022-07-22 22:39:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:27,676 INFO L225 Difference]: With dead ends: 2171 [2022-07-22 22:39:27,676 INFO L226 Difference]: Without dead ends: 2076 [2022-07-22 22:39:27,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 392 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-22 22:39:27,678 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 7 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3858 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:27,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3858 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-22 22:39:27,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-07-22 22:39:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2071. [2022-07-22 22:39:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2071 states, 1471 states have (on average 1.2182188987083618) internal successors, (1792), 1508 states have internal predecessors, (1792), 438 states have call successors, (438), 156 states have call predecessors, (438), 161 states have return successors, (464), 429 states have call predecessors, (464), 436 states have call successors, (464) [2022-07-22 22:39:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2694 transitions. [2022-07-22 22:39:27,733 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2694 transitions. Word has length 179 [2022-07-22 22:39:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:27,734 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 2694 transitions. [2022-07-22 22:39:27,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-22 22:39:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2694 transitions. [2022-07-22 22:39:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-22 22:39:27,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:27,736 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:39:27,773 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-22 22:39:27,939 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,SelfDestructingSolverStorable16 [2022-07-22 22:39:27,940 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:27,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:27,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1646245098, now seen corresponding path program 1 times [2022-07-22 22:39:27,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:27,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413238903] [2022-07-22 22:39:27,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:27,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:28,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:28,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:28,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 22:39:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 22:39:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 22:39:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 22:39:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-22 22:39:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-22 22:39:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 22:39:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 22:39:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-22 22:39:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-22 22:39:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-22 22:39:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-22 22:39:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:28,325 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-07-22 22:39:28,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:28,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413238903] [2022-07-22 22:39:28,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413238903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:39:28,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:39:28,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 22:39:28,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804361117] [2022-07-22 22:39:28,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:39:28,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 22:39:28,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:28,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 22:39:28,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:39:28,328 INFO L87 Difference]: Start difference. First operand 2071 states and 2694 transitions. Second operand has 10 states, 10 states have (on average 12.2) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-22 22:39:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:31,483 INFO L93 Difference]: Finished difference Result 3867 states and 5086 transitions. [2022-07-22 22:39:31,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 22:39:31,484 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 263 [2022-07-22 22:39:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:31,503 INFO L225 Difference]: With dead ends: 3867 [2022-07-22 22:39:31,503 INFO L226 Difference]: Without dead ends: 2110 [2022-07-22 22:39:31,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2022-07-22 22:39:31,508 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 465 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 2505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:31,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 3115 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-22 22:39:31,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-07-22 22:39:31,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2064. [2022-07-22 22:39:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1466 states have (on average 1.218963165075034) internal successors, (1787), 1503 states have internal predecessors, (1787), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-07-22 22:39:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2686 transitions. [2022-07-22 22:39:31,581 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2686 transitions. Word has length 263 [2022-07-22 22:39:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:31,582 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2686 transitions. [2022-07-22 22:39:31,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.2) internal successors, (122), 5 states have internal predecessors, (122), 3 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-22 22:39:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2686 transitions. [2022-07-22 22:39:31,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-22 22:39:31,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:31,587 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 22:39:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-22 22:39:31,588 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:31,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:31,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1841616438, now seen corresponding path program 1 times [2022-07-22 22:39:31,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:31,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121689455] [2022-07-22 22:39:31,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:31,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:31,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 22:39:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 22:39:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 22:39:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 22:39:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-22 22:39:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-22 22:39:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 22:39:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 22:39:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-22 22:39:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-22 22:39:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-22 22:39:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-22 22:39:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-22 22:39:31,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121689455] [2022-07-22 22:39:31,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121689455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:39:31,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:39:31,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 22:39:31,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374619050] [2022-07-22 22:39:31,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:39:31,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 22:39:31,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:31,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 22:39:31,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-22 22:39:31,907 INFO L87 Difference]: Start difference. First operand 2064 states and 2686 transitions. Second operand has 8 states, 8 states have (on average 14.875) internal successors, (119), 4 states have internal predecessors, (119), 4 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-22 22:39:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:33,794 INFO L93 Difference]: Finished difference Result 2130 states and 2809 transitions. [2022-07-22 22:39:33,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 22:39:33,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 4 states have internal predecessors, (119), 4 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 263 [2022-07-22 22:39:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:33,815 INFO L225 Difference]: With dead ends: 2130 [2022-07-22 22:39:33,815 INFO L226 Difference]: Without dead ends: 2120 [2022-07-22 22:39:33,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-07-22 22:39:33,817 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 1346 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 731 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:33,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 2378 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [731 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-22 22:39:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-07-22 22:39:33,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2064. [2022-07-22 22:39:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1466 states have (on average 1.218281036834925) internal successors, (1786), 1503 states have internal predecessors, (1786), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-07-22 22:39:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2685 transitions. [2022-07-22 22:39:33,898 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2685 transitions. Word has length 263 [2022-07-22 22:39:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:33,898 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2685 transitions. [2022-07-22 22:39:33,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.875) internal successors, (119), 4 states have internal predecessors, (119), 4 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-22 22:39:33,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2685 transitions. [2022-07-22 22:39:33,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-22 22:39:33,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:33,901 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:39:33,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-22 22:39:33,901 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:33,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:33,902 INFO L85 PathProgramCache]: Analyzing trace with hash 810198159, now seen corresponding path program 1 times [2022-07-22 22:39:33,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:33,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776351633] [2022-07-22 22:39:33,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:33,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 22:39:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 22:39:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 22:39:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 22:39:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-22 22:39:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-22 22:39:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 22:39:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 22:39:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-22 22:39:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-22 22:39:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-22 22:39:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-22 22:39:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:34,256 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-22 22:39:34,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:34,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776351633] [2022-07-22 22:39:34,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776351633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:39:34,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481460127] [2022-07-22 22:39:34,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:34,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:39:34,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:39:34,268 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-22 22:39:34,280 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-22 22:39:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 3081 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:39:35,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:39:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-07-22 22:39:35,157 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:39:35,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481460127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:39:35,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:39:35,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-22 22:39:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303260727] [2022-07-22 22:39:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:39:35,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:39:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:39:35,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:39:35,159 INFO L87 Difference]: Start difference. First operand 2064 states and 2685 transitions. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-22 22:39:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:35,406 INFO L93 Difference]: Finished difference Result 3806 states and 4963 transitions. [2022-07-22 22:39:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 22:39:35,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 268 [2022-07-22 22:39:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:35,413 INFO L225 Difference]: With dead ends: 3806 [2022-07-22 22:39:35,413 INFO L226 Difference]: Without dead ends: 2068 [2022-07-22 22:39:35,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:39:35,418 INFO L413 NwaCegarLoop]: 898 mSDtfsCounter, 373 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:35,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1506 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-22 22:39:35,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-07-22 22:39:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2064. [2022-07-22 22:39:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1466 states have (on average 1.2169167803547067) internal successors, (1784), 1503 states have internal predecessors, (1784), 438 states have call successors, (438), 156 states have call predecessors, (438), 159 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-07-22 22:39:35,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2683 transitions. [2022-07-22 22:39:35,480 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2683 transitions. Word has length 268 [2022-07-22 22:39:35,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:35,480 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2683 transitions. [2022-07-22 22:39:35,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 3 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-22 22:39:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2683 transitions. [2022-07-22 22:39:35,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-22 22:39:35,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:35,483 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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-22 22:39:35,525 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-22 22:39:35,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:39:35,696 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:35,696 INFO L85 PathProgramCache]: Analyzing trace with hash 589418021, now seen corresponding path program 1 times [2022-07-22 22:39:35,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:35,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464674504] [2022-07-22 22:39:35,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-22 22:39:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-22 22:39:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 22:39:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-22 22:39:35,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-22 22:39:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-22 22:39:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-22 22:39:35,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-22 22:39:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-22 22:39:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-22 22:39:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-22 22:39:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-22 22:39:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-22 22:39:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-22 22:39:35,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-22 22:39:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-22 22:39:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-22 22:39:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-22 22:39:35,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-22 22:39:35,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-22 22:39:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:35,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-22 22:39:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:36,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-22 22:39:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:36,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-22 22:39:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:36,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-22 22:39:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:36,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-22 22:39:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:36,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-22 22:39:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-22 22:39:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:36,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-22 22:39:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 20 proven. 13 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2022-07-22 22:39:36,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 22:39:36,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464674504] [2022-07-22 22:39:36,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464674504] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 22:39:36,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608575501] [2022-07-22 22:39:36,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:36,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 22:39:36,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:39:36,097 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-22 22:39:36,130 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-22 22:39:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:39:37,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 22:39:37,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:39:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-07-22 22:39:37,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:39:37,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608575501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:39:37,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 22:39:37,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-22 22:39:37,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178509030] [2022-07-22 22:39:37,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:39:37,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:39:37,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 22:39:37,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:39:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-22 22:39:37,050 INFO L87 Difference]: Start difference. First operand 2064 states and 2683 transitions. Second operand has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-22 22:39:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:39:37,166 INFO L93 Difference]: Finished difference Result 3810 states and 4981 transitions. [2022-07-22 22:39:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:39:37,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 288 [2022-07-22 22:39:37,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:39:37,172 INFO L225 Difference]: With dead ends: 3810 [2022-07-22 22:39:37,172 INFO L226 Difference]: Without dead ends: 2072 [2022-07-22 22:39:37,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:39:37,177 INFO L413 NwaCegarLoop]: 659 mSDtfsCounter, 30 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1913 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:39:37,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1913 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:39:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-07-22 22:39:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2022-07-22 22:39:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2072 states, 1473 states have (on average 1.2165648336727766) internal successors, (1792), 1510 states have internal predecessors, (1792), 438 states have call successors, (438), 157 states have call predecessors, (438), 160 states have return successors, (461), 427 states have call predecessors, (461), 436 states have call successors, (461) [2022-07-22 22:39:37,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2691 transitions. [2022-07-22 22:39:37,241 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2691 transitions. Word has length 288 [2022-07-22 22:39:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:39:37,241 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 2691 transitions. [2022-07-22 22:39:37,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.5) internal successors, (162), 4 states have internal predecessors, (162), 3 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-22 22:39:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2691 transitions. [2022-07-22 22:39:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-22 22:39:37,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:39:37,247 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:39:37,271 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-22 22:39:37,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-22 22:39:37,473 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:39:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:39:37,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1005655303, now seen corresponding path program 1 times [2022-07-22 22:39:37,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 22:39:37,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587141076] [2022-07-22 22:39:37,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:39:37,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 22:39:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 22:39:38,629 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 22:39:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 22:39:41,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 22:39:41,278 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 22:39:41,279 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 22:39:41,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-22 22:39:41,282 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:39:41,286 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 22:39:41,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 10:39:41 BoogieIcfgContainer [2022-07-22 22:39:41,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 22:39:41,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 22:39:41,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 22:39:41,525 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 22:39:41,525 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:38:31" (3/4) ... [2022-07-22 22:39:41,528 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 22:39:41,528 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 22:39:41,529 INFO L158 Benchmark]: Toolchain (without parser) took 73493.78ms. Allocated memory was 100.7MB in the beginning and 809.5MB in the end (delta: 708.8MB). Free memory was 60.3MB in the beginning and 277.9MB in the end (delta: -217.6MB). Peak memory consumption was 492.2MB. Max. memory is 16.1GB. [2022-07-22 22:39:41,529 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:39:41,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1548.29ms. Allocated memory was 100.7MB in the beginning and 169.9MB in the end (delta: 69.2MB). Free memory was 60.2MB in the beginning and 49.1MB in the end (delta: 11.1MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2022-07-22 22:39:41,533 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.69ms. Allocated memory is still 169.9MB. Free memory was 49.1MB in the beginning and 116.1MB in the end (delta: -67.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-07-22 22:39:41,534 INFO L158 Benchmark]: Boogie Preprocessor took 147.20ms. Allocated memory is still 169.9MB. Free memory was 116.1MB in the beginning and 103.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 22:39:41,534 INFO L158 Benchmark]: RCFGBuilder took 1997.58ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 103.3MB in the beginning and 146.9MB in the end (delta: -43.5MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2022-07-22 22:39:41,534 INFO L158 Benchmark]: TraceAbstraction took 69642.59ms. Allocated memory was 228.6MB in the beginning and 809.5MB in the end (delta: 580.9MB). Free memory was 146.9MB in the beginning and 277.9MB in the end (delta: -131.0MB). Peak memory consumption was 470.2MB. Max. memory is 16.1GB. [2022-07-22 22:39:41,535 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 809.5MB. Free memory is still 277.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 22:39:41,541 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.19ms. Allocated memory is still 100.7MB. Free memory is still 54.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1548.29ms. Allocated memory was 100.7MB in the beginning and 169.9MB in the end (delta: 69.2MB). Free memory was 60.2MB in the beginning and 49.1MB in the end (delta: 11.1MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.69ms. Allocated memory is still 169.9MB. Free memory was 49.1MB in the beginning and 116.1MB in the end (delta: -67.0MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 147.20ms. Allocated memory is still 169.9MB. Free memory was 116.1MB in the beginning and 103.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1997.58ms. Allocated memory was 169.9MB in the beginning and 228.6MB in the end (delta: 58.7MB). Free memory was 103.3MB in the beginning and 146.9MB in the end (delta: -43.5MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. * TraceAbstraction took 69642.59ms. Allocated memory was 228.6MB in the beginning and 809.5MB in the end (delta: 580.9MB). Free memory was 146.9MB in the beginning and 277.9MB in the end (delta: -131.0MB). Peak memory consumption was 470.2MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 809.5MB. Free memory is still 277.9MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 6946]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of large string literal at line 6635, overapproximation of bitwiseOr at line 5696, overapproximation of shiftLeft at line 5141, overapproximation of bitwiseAnd at line 4928. Possible FailurePath: [L5170-L5181] static char const __mod_author63[40] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'a', (char const )'u', (char const )'t', (char const )'h', (char const )'o', (char const )'r', (char const )'=', (char const )'V', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )' ', (char const )'P', (char const )'a', (char const )'v', (char const )'l', (char const )'i', (char const )'k', (char const )' ', (char const )'<', (char const )'v', (char const )'o', (char const )'j', (char const )'t', (char const )'e', (char const )'c', (char const )'h', (char const )'@', (char const )'s', (char const )'u', (char const )'s', (char const )'e', (char const )'.', (char const )'c', (char const )'z', (char const )'>', (char const )'\000'}; [L5182-L5197] static char const __mod_description64[53] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'d', (char const )'e', (char const )'s', (char const )'c', (char const )'r', (char const )'i', (char const )'p', (char const )'t', (char const )'i', (char const )'o', (char const )'n', (char const )'=', (char const )'C', (char const )'A', (char const )'T', (char const )'C', (char const )' ', (char const )'E', (char const )'L', (char const )'1', (char const )'2', (char const )'1', (char const )'0', (char const )'A', (char const )' ', (char const )'N', (char const )'e', (char const )'t', (char const )'M', (char const )'a', (char const )'t', (char const )'e', (char const )' ', (char const )'U', (char const )'S', (char const )'B', (char const )' ', (char const )'E', (char const )'t', (char const )'h', (char const )'e', (char const )'r', (char const )'n', (char const )'e', (char const )'t', (char const )' ', (char const )'d', (char const )'r', (char const )'i', (char const )'v', (char const )'e', (char const )'r', (char const )'\000'}; [L5198-L5202] static char const __mod_license65[12] __attribute__((__used__, __unused__, __section__(".modinfo"), __aligned__(1))) = { (char const )'l', (char const )'i', (char const )'c', (char const )'e', (char const )'n', (char const )'s', (char const )'e', (char const )'=', (char const )'G', (char const )'P', (char const )'L', (char const )'\000'}; [L5203-L5204] static char const driver_name[5] = { (char const )'c', (char const )'a', (char const )'t', (char const )'c', (char const )'\000'}; [L6129-L6176] static struct ethtool_ops const ops = {& catc_get_settings, (int (*)(struct net_device * , struct ethtool_cmd * ))0, & catc_get_drvinfo, (int (*)(struct net_device * ))0, (void (*)(struct net_device * , struct ethtool_regs * , void * ))0, (void (*)(struct net_device * , struct ethtool_wolinfo * ))0, (int (*)(struct net_device * , struct ethtool_wolinfo * ))0, (u32 (*)(struct net_device * ))0, (void (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * ))0, & ethtool_op_get_link, (int (*)(struct net_device * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_eeprom * , u8 * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (int (*)(struct net_device * , struct ethtool_coalesce * ))0, (void (*)(struct net_device * , struct ethtool_ringparam * ))0, (int (*)(struct net_device * , struct ethtool_ringparam * ))0, (void (*)(struct net_device * , struct ethtool_pauseparam * ))0, (int (*)(struct net_device * , struct ethtool_pauseparam * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (void (*)(struct net_device * , struct ethtool_test * , u64 * ))0, (void (*)(struct net_device * , u32 stringset , u8 * ))0, (int (*)(struct net_device * , enum ethtool_phys_id_state ))0, (void (*)(struct net_device * , struct ethtool_stats * , u64 * ))0, (int (*)(struct net_device * ))0, (void (*)(struct net_device * ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (u32 (*)(struct net_device * ))0, (int (*)(struct net_device * , u32 ))0, (int (*)(struct net_device * , int ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * , void * ))0, (int (*)(struct net_device * , struct ethtool_rxnfc * ))0, (int (*)(struct net_device * , struct ethtool_flash * ))0, (int (*)(struct net_device * , u32 * ))0, (int (*)(struct net_device * , struct ethtool_rx_ntuple * ))0, (int (*)(struct net_device * , u32 stringset , void * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir * ))0, (int (*)(struct net_device * , struct ethtool_rxfh_indir const * ))0, (void (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_channels * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0, (int (*)(struct net_device * , struct ethtool_dump * , void * ))0, (int (*)(struct net_device * , struct ethtool_dump * ))0}; [L6231-L6269] static struct net_device_ops const catc_netdev_ops = {(int (*)(struct net_device *dev ))0, (void (*)(struct net_device *dev ))0, & catc_open, & catc_stop, & catc_start_xmit, (u16 (*)(struct net_device *dev , struct sk_buff *skb ))0, (void (*)(struct net_device *dev , int flags ))0, (void (*)(struct net_device *dev ))0, & catc_set_multicast_list, & eth_mac_addr, & eth_validate_addr, (int (*)(struct net_device *dev , struct ifreq *ifr , int cmd ))0, (int (*)(struct net_device *dev , struct ifmap *map ))0, & eth_change_mtu, (int (*)(struct net_device *dev , struct neigh_parms * ))0, & catc_tx_timeout, (struct rtnl_link_stats64 *(*)(struct net_device *dev , struct rtnl_link_stats64 *storage ))0, (struct net_device_stats *(*)(struct net_device *dev ))0, (void (*)(struct net_device *dev , struct vlan_group *grp ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev , unsigned short vid ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , struct netpoll_info *info ))0, (void (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , int queue , u8 *mac ))0, (int (*)(struct net_device *dev , int queue , u16 vlan , u8 qos ))0, (int (*)(struct net_device *dev , int vf , int rate ))0, (int (*)(struct net_device *dev , int vf , struct ifla_vf_info *ivf ))0, (int (*)(struct net_device *dev , int vf , struct nlattr **port ))0, (int (*)(struct net_device *dev , int vf , struct sk_buff *skb ))0, (int (*)(struct net_device *dev , u8 tc ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u16 xid ))0, (int (*)(struct net_device *dev , u16 xid , struct scatterlist *sgl , unsigned int sgc ))0, (int (*)(struct net_device *dev , u64 *wwn , int type ))0, (int (*)(struct net_device *dev , struct sk_buff const *skb , u16 rxq_index , u32 flow_id ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (int (*)(struct net_device *dev , struct net_device *slave_dev ))0, (u32 (*)(struct net_device *dev , u32 features ))0, (int (*)(struct net_device *dev , u32 features ))0}; [L6270] static struct lock_class_key __key___9 ; [L6271] static struct lock_class_key __key___10 ; [L6272] static struct lock_class_key __key___11 ; [L6684-L6692] static struct usb_device_id catc_id_table[3] = { {(__u16 )3, (__u16 )1059, (__u16 )10, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )1059, (__u16 )12, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {(__u16 )3, (__u16 )2257, (__u16 )1, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}}; [L6695-L6710] static struct usb_driver catc_driver = {driver_name, & catc_probe, & catc_disconnect, (int (*)(struct usb_interface *intf , unsigned int code , void *buf ))0, (int (*)(struct usb_interface *intf , pm_message_t message ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (int (*)(struct usb_interface *intf ))0, (struct usb_device_id const *)(catc_id_table), {{{{{0U}, 0U, 0U, (void *)0, {(struct lock_class_key *)0, {(struct lock_class *)0, (struct lock_class *)0}, (char const *)0, 0, 0UL}}}}, {(struct list_head *)0, (struct list_head *)0}}, {{(char const *)0, (struct bus_type *)0, (struct module *)0, (char const *)0, (_Bool)0, (struct of_device_id const *)0, (int (*)(struct device *dev ))0, (int (*)(struct device *dev ))0, (void (*)(struct device *dev ))0, (int (*)(struct device *dev , pm_message_t state ))0, (int (*)(struct device *dev ))0, (struct attribute_group const **)0, (struct dev_pm_ops const *)0, (struct driver_private *)0}, 0}, 0U, 0U, 0U}; [L6763] int LDV_IN_INTERRUPT ; [L6764] static int res_catc_open_15 ; [L6765] static int res_catc_stop_16 ; [L6766] static int res_catc_probe_17 ; [L6959] int ldv_urb_state = 0; [L6960] int ldv_coherent_state = 0; VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6768] struct net_device *var_group1 ; [L6769] struct ethtool_drvinfo *var_group2 ; [L6770] struct ethtool_cmd *var_group3 ; [L6771] struct sk_buff *var_group4 ; [L6772] struct usb_interface *var_group5 ; [L6773] struct usb_device_id const *var_catc_probe_17_p1 ; [L6774] unsigned long var_catc_stats_timer_10_p0 ; [L6775] int tmp___7 ; [L6776] int ldv_s_catc_netdev_ops_net_device_ops ; [L6777] int ldv_s_catc_driver_usb_driver ; [L6778] int tmp___8 ; [L6779] int tmp___9 ; [L6782] LDV_IN_INTERRUPT = 1 [L6783] FCALL ldv_initialize() [L6784] CALL, EXPR catc_init() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6714] int result ; [L6715] int tmp___7 ; [L6718] CALL, EXPR usb_register(& catc_driver) [L5088] int tmp___7 ; [L5091] CALL, EXPR usb_register_driver(driver, & __this_module, "catc") [L7209] return __VERIFIER_nondet_int(); [L5091] RET, EXPR usb_register_driver(driver, & __this_module, "catc") [L5091] tmp___7 = usb_register_driver(driver, & __this_module, "catc") [L5093] return (tmp___7); VAL [\result=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver={32:0}, driver={32:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6718] RET, EXPR usb_register(& catc_driver) [L6718] tmp___7 = usb_register(& catc_driver) [L6719] result = tmp___7 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, result=0, tmp___7=0] [L6721] COND TRUE result == 0 [L6727] return (result); VAL [\result=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, result=0, tmp___7=0] [L6784] RET, EXPR catc_init() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_init()=0, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6784] tmp___7 = catc_init() [L6786] COND FALSE !(\read(tmp___7)) [L6790] ldv_s_catc_netdev_ops_net_device_ops = 0 [L6791] ldv_s_catc_driver_usb_driver = 0 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6793] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___9=1] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1] [L6895] COND TRUE ldv_s_catc_driver_usb_driver == 0 [L6897] CALL, EXPR catc_probe(var_group5, var_catc_probe_17_p1) [L6274] struct usb_device *usbdev ; [L6275] struct usb_device *tmp___7 ; [L6276] struct net_device *netdev ; [L6277] struct catc *catc ; [L6278] u8 broadcast[6] ; [L6279] int i ; [L6280] int pktsz ; [L6281] int tmp___8 ; [L6282] void *tmp___9 ; [L6283] unsigned int tmp___10 ; [L6284] unsigned int tmp___11 ; [L6285] unsigned int tmp___12 ; [L6286] unsigned int tmp___13 ; [L6287] char const *tmp___14 ; [L6288] int tmp___15 ; [L6291] CALL, EXPR interface_to_usbdev(intf) [L5065] struct device const *__mptr ; [L5067] EXPR intf->dev.parent [L5067] __mptr = (struct device const *)intf->dev.parent [L5068] return ((struct usb_device *)((char *)__mptr - (unsigned int )(& ((struct usb_device *)0)->dev))); VAL [\result={-8:172}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __mptr={-8:303}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6291] RET, EXPR interface_to_usbdev(intf) [L6291] tmp___7 = interface_to_usbdev(intf) [L6292] usbdev = tmp___7 [L6293] EXPR intf->altsetting [L6293] EXPR (intf->altsetting)->desc.bInterfaceNumber [L6293-L6294] CALL, EXPR usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L7213] return __VERIFIER_nondet_int(); [L6293-L6294] RET, EXPR usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6293-L6294] tmp___8 = usb_set_interface(usbdev, (int )(intf->altsetting)->desc.bInterfaceNumber, 1) [L6296] COND FALSE !(\read(tmp___8)) [L6304] CALL, EXPR alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L7117] CALL, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(size)=2416, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7117] RET, EXPR ldv_malloc(sizeof(struct net_device)) VAL [\old(arg0)=70119, \old(arg1)=1, \old(arg2)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arg0=70119, arg1=1, arg2=1, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct net_device))={33:0}, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7117] return ldv_malloc(sizeof(struct net_device)); [L6304] RET, EXPR alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6304] netdev = alloc_etherdev_mqs((int )sizeof(struct catc ), 1U, 1U) [L6306] COND FALSE !(! netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, usbdev={-8:172}] [L6311] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={33:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={33:-47}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={33:0}, dev={33:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6311] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, netdev_priv((struct net_device const *)netdev)={33:-47}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, usbdev={-8:172}] [L6311] tmp___9 = netdev_priv((struct net_device const *)netdev) [L6312] catc = (struct catc *)tmp___9 [L6313] netdev->netdev_ops = & catc_netdev_ops [L6314] netdev->watchdog_timeo = 1250 [L6315] netdev->ethtool_ops = & ops [L6316] catc->usbdev = usbdev [L6317] catc->netdev = netdev VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6320] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6323] CALL spinlock_check(& catc->tx_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:-7}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [\result={33:-7}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:-7}, lock={33:-7}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6323] RET spinlock_check(& catc->tx_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, spinlock_check(& catc->tx_lock)={33:-7}, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6326] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6329-L6330] FCALL __raw_spin_lock_init(& catc->tx_lock.__annonCompField18.rlock, "&(&catc->tx_lock)->rlock", & __key___9) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6343] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6346] CALL spinlock_check(& catc->ctrl_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:57}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L4851] return (& lock->__annonCompField18.rlock); VAL [\result={33:57}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, lock={33:57}, lock={33:57}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L6346] RET spinlock_check(& catc->ctrl_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, spinlock_check(& catc->ctrl_lock)={33:57}, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6349] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6352-L6353] FCALL __raw_spin_lock_init(& catc->ctrl_lock.__annonCompField18.rlock, "&(&catc->ctrl_lock)->rlock", & __key___10) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6366] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6369] FCALL init_timer_key(& catc->timer, "&catc->timer", & __key___11) [L6377] catc->timer.data = (unsigned long )((long )catc) [L6378] catc->timer.function = & catc_stats_timer VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6379] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, \old(size)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-10:0}, ldv_urb_state=0, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-10:0}, ldv_urb_state=0, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-10:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-10:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=0, \old(mem_flags)=208, \result={-10:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-10:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-10:0}] [L6379] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usb_alloc_urb(0, 208U)={-10:0}, usbdev={-8:172}] [L6379] catc->ctrl_urb = usb_alloc_urb(0, 208U) [L6380] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=1, \old(size)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-5:0}, ldv_urb_state=1, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-5:0}, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=1, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-5:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=1, \old(mem_flags)=208, \result={-5:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-5:0}] [L6380] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usb_alloc_urb(0, 208U)={-5:0}, usbdev={-8:172}] [L6380] catc->tx_urb = usb_alloc_urb(0, 208U) [L6381] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=2, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=2, \old(size)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=2, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-6:0}, ldv_urb_state=2, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-6:0}, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=2, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-6:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=2, \old(mem_flags)=208, \result={-6:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-6:0}] [L6381] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usb_alloc_urb(0, 208U)={-6:0}, usbdev={-8:172}] [L6381] catc->rx_urb = usb_alloc_urb(0, 208U) [L6382] CALL, EXPR usb_alloc_urb(0, 208U) VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7022] void *arbitrary_memory ; [L7023] void *tmp___7 ; VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7026] COND TRUE 1 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] CALL, EXPR ldv_undefined_pointer() VAL [\old(ldv_urb_state)=3, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] CALL, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=3, \old(size)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7113] COND FALSE !(__VERIFIER_nondet_bool()) [L7114] return malloc(size); [L7161] RET, EXPR ldv_malloc(0UL) VAL [\old(ldv_urb_state)=3, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_malloc(0UL)={-8:0}, ldv_urb_state=3, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7161] return ldv_malloc(0UL); [L7029] RET, EXPR ldv_undefined_pointer() VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_undefined_pointer()={-8:0}, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L7029] tmp___7 = ldv_undefined_pointer() [L7030] arbitrary_memory = tmp___7 VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-8:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=3, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:0}] [L7032] COND FALSE !(! arbitrary_memory) [L7036] ldv_urb_state = ldv_urb_state + 1 [L7037] return ((struct urb *)arbitrary_memory); VAL [\old(iso_packets)=0, \old(ldv_urb_state)=3, \old(mem_flags)=208, \result={-8:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arbitrary_memory={-8:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, iso_packets=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, mem_flags=208, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:0}] [L6382] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usb_alloc_urb(0, 208U)={-8:0}, usbdev={-8:172}] [L6382] catc->irq_urb = usb_alloc_urb(0, 208U) [L6384] EXPR catc->ctrl_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->ctrl_urb={-10:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6384] COND FALSE !(! catc->ctrl_urb) [L6387] EXPR catc->tx_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->tx_urb={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6387] COND FALSE !(! catc->tx_urb) [L6390] EXPR catc->rx_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->rx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6390] COND FALSE !(! catc->rx_urb) [L6393] EXPR catc->irq_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->irq_urb={-8:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6393] COND FALSE !(! catc->irq_urb) [L6406] EXPR usbdev->descriptor.idVendor VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}, usbdev->descriptor.idVendor=70] [L6406] COND FALSE !((int )usbdev->descriptor.idVendor == 1059) [L6429] pktsz = 23070 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6432] CALL, EXPR __create_pipe(usbdev, 0U) VAL [\old(endpoint)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6432] RET, EXPR __create_pipe(usbdev, 0U) VAL [__create_pipe(usbdev, 0U)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6432] tmp___10 = __create_pipe(usbdev, 0U) [L6433] EXPR catc->ctrl_urb [L6433-L6435] CALL usb_fill_control_urb(catc->ctrl_urb, usbdev, (unsigned int )(2 << 30) | tmp___10, (unsigned char *)((void *)0), (void *)0, 0, & catc_ctrl_done, (void *)catc) [L5103] urb->dev = dev [L5104] urb->pipe = pipe [L5105] urb->setup_packet = setup_packet [L5106] urb->transfer_buffer = transfer_buffer [L5107] urb->transfer_buffer_length = (u32 )buffer_length [L5108] urb->complete = complete_fn [L5109] urb->context = context VAL [\old(buffer_length)=0, \old(pipe)=24, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=0, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:13}, complete_fn={-1:13}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=24, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, setup_packet={0:0}, setup_packet={0:0}, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-10:0}, urb={-10:0}] [L6433-L6435] RET usb_fill_control_urb(catc->ctrl_urb, usbdev, (unsigned int )(2 << 30) | tmp___10, (unsigned char *)((void *)0), (void *)0, 0, & catc_ctrl_done, (void *)catc) [L6436] CALL, EXPR __create_pipe(usbdev, 1U) VAL [\old(endpoint)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6436] RET, EXPR __create_pipe(usbdev, 1U) VAL [__create_pipe(usbdev, 1U)=32768, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6436] tmp___11 = __create_pipe(usbdev, 1U) [L6437] EXPR catc->tx_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->tx_urb={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6437-L6438] CALL usb_fill_bulk_urb(catc->tx_urb, usbdev, (unsigned int )(3 << 30) | tmp___11, (void *)0, 0, & catc_tx_done, (void *)catc) VAL [\old(buffer_length)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:14}, context={33:-47}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, urb={-5:0}] [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [\old(buffer_length)=0, \old(pipe)=4294967277, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=0, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:14}, complete_fn={-1:14}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967277, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-5:0}, urb={-5:0}] [L6437-L6438] RET usb_fill_bulk_urb(catc->tx_urb, usbdev, (unsigned int )(3 << 30) | tmp___11, (void *)0, 0, & catc_tx_done, (void *)catc) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->tx_urb={-5:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6439] CALL, EXPR __create_pipe(usbdev, 1U) VAL [\old(endpoint)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6439] RET, EXPR __create_pipe(usbdev, 1U) VAL [__create_pipe(usbdev, 1U)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6439] tmp___12 = __create_pipe(usbdev, 1U) [L6440] EXPR catc->rx_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->rx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6440-L6441] CALL usb_fill_bulk_urb(catc->rx_urb, usbdev, ((unsigned int )(3 << 30) | tmp___12) | 128U, (void *)(catc->rx_buf), pktsz, & catc_rx_done, (void *)catc) VAL [\old(buffer_length)=23070, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:15}, context={33:-47}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46261}, urb={-6:0}] [L5119] urb->dev = dev [L5120] urb->pipe = pipe [L5121] urb->transfer_buffer = transfer_buffer [L5122] urb->transfer_buffer_length = (u32 )buffer_length [L5123] urb->complete = complete_fn [L5124] urb->context = context VAL [\old(buffer_length)=23070, \old(pipe)=4294967255, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=23070, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:15}, complete_fn={-1:15}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967255, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46261}, transfer_buffer={33:46261}, urb={-6:0}, urb={-6:0}] [L6440-L6441] RET usb_fill_bulk_urb(catc->rx_urb, usbdev, ((unsigned int )(3 << 30) | tmp___12) | 128U, (void *)(catc->rx_buf), pktsz, & catc_rx_done, (void *)catc) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->rx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6442] CALL, EXPR __create_pipe(usbdev, 2U) VAL [\old(endpoint)=2, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L6442] RET, EXPR __create_pipe(usbdev, 2U) VAL [__create_pipe(usbdev, 2U)=65536, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6442] tmp___13 = __create_pipe(usbdev, 2U) [L6443] EXPR catc->irq_urb [L6443-L6444] CALL usb_fill_int_urb(catc->irq_urb, usbdev, ((unsigned int )(1 << 30) | tmp___13) | 128U, (void *)(catc->irq_buf), 2, & catc_irq_done, (void *)catc, 1) [L5134] urb->dev = dev [L5135] urb->pipe = pipe [L5136] urb->transfer_buffer = transfer_buffer [L5137] urb->transfer_buffer_length = (u32 )buffer_length [L5138] urb->complete = complete_fn [L5139] urb->context = context [L5140] EXPR dev->speed VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=4294967278, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=2, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, dev->speed=4294967299, driver_name={25:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967278, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69331}, transfer_buffer={33:69331}, urb={-8:0}, urb={-8:0}] [L5140] COND TRUE (unsigned int )dev->speed == 3U [L5141] urb->interval = 1 << (interval - 1) VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=4294967278, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=2, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967278, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69331}, transfer_buffer={33:69331}, urb={-8:0}, urb={-8:0}] [L5148] urb->start_frame = -1 VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=4294967278, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buffer_length=2, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:16}, complete_fn={-1:16}, context={33:-47}, context={33:-47}, dev={-8:172}, dev={-8:172}, driver_name={25:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=4294967278, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69331}, transfer_buffer={33:69331}, urb={-8:0}, urb={-8:0}] [L6443-L6444] RET usb_fill_int_urb(catc->irq_urb, usbdev, ((unsigned int )(1 << 30) | tmp___13) | 128U, (void *)(catc->irq_buf), 2, & catc_irq_done, (void *)catc, 1) [L6446] EXPR catc->is_f5u011 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->is_f5u011=75, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6446] COND FALSE !(! catc->is_f5u011) [L6599] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, usbdev={-8:172}] [L6607] CALL catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0) VAL [\old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608, value=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __create_pipe(catc->usbdev, 0U)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=18446744073709551608, value=0] [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___8=2147483904, tmp___9=2147483905, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___8=2147483904, tmp___9=2147483905, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483904, tmp___9=2147483905, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=18446744073709551608, \old(value)=0, \result=-1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={0:0}, buf={0:0}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=0, ops={26:0}, request=244, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=2147483904, tmp___9=2147483905, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L6607] RET catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0)=-1, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6608] EXPR netdev->dev_addr VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551591:18446744073709551634}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6608-L6609] CALL catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6) VAL [\old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5684] COND TRUE \read(dir) [L5686] EXPR catc->usbdev VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5686] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5686] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __create_pipe(catc->usbdev, 0U)=1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5686] tmp___7 = __create_pipe(catc->usbdev, 0U) [L5687] tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=1, tmp___9=4294967266, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___7=1, tmp___9=4294967266, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___7=1, tmp___9=4294967266, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5705] return (tmp___11); VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, \result=-1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={18446744073709551591:18446744073709551634}, buf={18446744073709551591:18446744073709551634}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=128, driver_name={25:0}, index=0, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=6, ops={26:0}, request=242, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___7=1, tmp___9=4294967266, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L6608-L6609] RET catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6)=-1, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551591:18446744073709551634}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6612] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6620] catc->rxmode[0] = (u8 )11 [L6621] catc->rxmode[1] = (u8 )0 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, usbdev={-8:172}] [L6622-L6623] CALL catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2) VAL [\old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904] [L5677] int retval ; [L5678] unsigned int tmp___7 ; [L5679] unsigned int tmp___8 ; [L5680] unsigned int tmp___9 ; [L5681] int tmp___10 ; [L5682] int tmp___11 ; VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5684] COND FALSE !(\read(dir)) [L5691] EXPR catc->usbdev VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-8:172}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904] [L5167] EXPR dev->devnum [L5167] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L5691] RET, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __create_pipe(catc->usbdev, 0U)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc->usbdev={-8:172}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483904, value=0] [L5691] tmp___8 = __create_pipe(catc->usbdev, 0U) [L5692] tmp___9 = (unsigned int )(2 << 30) | tmp___8 VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___8=0, tmp___9=2147483649, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, value=0] [L5696] EXPR catc->usbdev [L5696-L5697] CALL, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L7199] return __VERIFIER_nondet_int(); [L5696-L5697] RET, EXPR usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5696-L5697] tmp___10 = usb_control_msg(catc->usbdev, tmp___9, request, (__u8 )(64 | (int )dir), value, index, buf, (__u16 )len, 1000) [L5698] retval = tmp___10 VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___8=0, tmp___9=2147483649, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, value=0] [L5700] COND TRUE retval < 0 [L5701] tmp___11 = retval VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=0, tmp___9=2147483649, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U)=18446744073709551633, \old(tmp___9 = (unsigned int )(2 << 30) | tmp___8)=2147483904, \old(value)=0, \result=-1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, buf={33:70066}, buf={33:70066}, catc={33:-47}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dir=0, driver_name={25:0}, index=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, len=2, ops={26:0}, request=245, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, retval=-1, tmp___10=-1, tmp___11=-1, tmp___8=0, tmp___9=2147483649, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, value=0] [L6622-L6623] RET catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2)=-1, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6627] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6634] catc->is_f5u011 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc->is_f5u011=75, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6634] COND TRUE catc->is_f5u011 [L6635] tmp___14 = "Belkin F5U011" VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___14={21:0}, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6640] EXPR usbdev->bus [L6640] (usbdev->bus)->bus_name [L6641] netdev->dev_addr [L6642] CALL usb_set_intfdata(intf, (void *)catc) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L5059] CALL dev_set_drvdata(& intf->dev, data) [L7138] return __VERIFIER_nondet_int(); [L5059] RET dev_set_drvdata(& intf->dev, data) [L6642] RET usb_set_intfdata(intf, (void *)catc) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, broadcast={53:0}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={55:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___14={21:0}, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6643] netdev->dev.parent = & intf->dev [L6644] CALL, EXPR register_netdev(netdev) [L7187] return __VERIFIER_nondet_int(); [L6644] RET, EXPR register_netdev(netdev) [L6644] tmp___15 = register_netdev(netdev) [L6646] COND FALSE !(tmp___15 != 0) [L6658] return (0); [L6658] return (0); [L6658] return (0); VAL [\result=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc={33:-47}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, id={18446744073709551643:18446744073709551609}, id={18446744073709551643:18446744073709551609}, intf={18446744073709551585:73}, intf={18446744073709551585:73}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=0, tmp___11=32768, tmp___12=1, tmp___13=65536, tmp___14={21:0}, tmp___15=0, tmp___7={-8:172}, tmp___8=0, tmp___9={33:-47}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usbdev={-8:172}] [L6897] RET, EXPR catc_probe(var_group5, var_catc_probe_17_p1) [L6897] res_catc_probe_17 = catc_probe(var_group5, var_catc_probe_17_p1) [L6898] FCALL ldv_check_return_value(res_catc_probe_17) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=0, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6900] COND FALSE !(\read(res_catc_probe_17)) [L6904] ldv_s_catc_driver_usb_driver = ldv_s_catc_driver_usb_driver + 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6793] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6796] tmp___9 = __VERIFIER_nondet_int() [L6798] COND TRUE \read(tmp___9) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=7, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6807] tmp___8 = __VERIFIER_nondet_int() [L6809] COND FALSE !(tmp___8 == 0) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group5={18446744073709551585:73}] [L6852] COND TRUE ldv_s_catc_netdev_ops_net_device_ops == 0 [L6854] CALL, EXPR catc_open(var_group1) [L6178] struct catc *catc ; [L6179] void *tmp___7 ; [L6180] int status ; VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6183] CALL, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={18446744073709551641:-3}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={18446744073709551641:-83}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={18446744073709551641:-3}, dev={18446744073709551641:-3}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6183] RET, EXPR netdev_priv((struct net_device const *)netdev) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, netdev_priv((struct net_device const *)netdev)={18446744073709551641:-83}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6183] tmp___7 = netdev_priv((struct net_device const *)netdev) [L6184] catc = (struct catc *)tmp___7 [L6185] EXPR catc->irq_urb [L6185] EXPR catc->usbdev [L6185] (catc->irq_urb)->dev = catc->usbdev [L6186] EXPR catc->irq_urb VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc={18446744073709551641:-83}, catc->irq_urb={18446744073709551641:74}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551641:-83}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6186] CALL, EXPR usb_submit_urb(catc->irq_urb, 208U) VAL [\old(arg1)=208, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, arg0={18446744073709551641:74}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L7217] return __VERIFIER_nondet_int(); [L6186] RET, EXPR usb_submit_urb(catc->irq_urb, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc={18446744073709551641:-83}, catc->irq_urb={18446744073709551641:74}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551641:-83}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, usb_submit_urb(catc->irq_urb, 208U)=-1] [L6186] status = usb_submit_urb(catc->irq_urb, 208U) [L6188] COND TRUE status < 0 [L6192] return (-1); VAL [\result=-1, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc={18446744073709551641:-83}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={18446744073709551641:-3}, netdev={18446744073709551641:-3}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, status=-1, tmp___7={18446744073709551641:-83}, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6854] RET, EXPR catc_open(var_group1) [L6854] res_catc_open_15 = catc_open(var_group1) [L6855] FCALL ldv_check_return_value(res_catc_open_15) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group1={18446744073709551641:-3}, var_group5={18446744073709551585:73}] [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group1={18446744073709551641:-3}, var_group5={18446744073709551585:73}] [L6934] CALL catc_exit() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6736] FCALL usb_deregister(& catc_driver) [L6934] RET catc_exit() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_s_catc_driver_usb_driver=1, ldv_s_catc_netdev_ops_net_device_ops=0, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7=0, tmp___8=2, tmp___9=1, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648, var_catc_probe_17_p1={18446744073709551643:18446744073709551609}, var_group1={18446744073709551641:-3}, var_group5={18446744073709551585:73}] [L6938] CALL ldv_check_final_state() [L7081] COND FALSE !(ldv_urb_state == 0) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L7084] CALL ldv_blast_assert() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] [L6946] reach_error() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551626:18446744073709551574}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, res_catc_open_15=-1, res_catc_probe_17=0, res_catc_stop_16=0, tmp___9 = ((unsigned int )(2 << 30) | tmp___7) | 128U=18446744073709551633, tmp___9 = (unsigned int )(2 << 30) | tmp___8=2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 37 procedures, 548 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 69.3s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 43.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17887 SdHoareTripleChecker+Valid, 40.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16786 mSDsluCounter, 70329 SdHoareTripleChecker+Invalid, 36.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1632 IncrementalHoareTripleChecker+Unchecked, 54274 mSDsCounter, 7806 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30818 IncrementalHoareTripleChecker+Invalid, 40256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7806 mSolverCounterUnsat, 16055 mSDtfsCounter, 30818 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4774 GetRequests, 4441 SyntacticMatches, 27 SemanticMatches, 306 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2105occurred in iteration=16, InterpolantAutomatonStates: 229, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 368 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 5759 NumberOfCodeBlocks, 5759 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 6880 ConstructedInterpolants, 154 QuantifiedInterpolants, 18409 SizeOfPredicates, 37 NumberOfNonLiveVariables, 27576 ConjunctsInSsa, 321 ConjunctsInUnsatCore, 43 InterpolantComputations, 15 PerfectInterpolantSequences, 4936/5290 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 22:39:41,579 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 22:39:43,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 22:39:43,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 22:39:43,461 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 22:39:43,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 22:39:43,462 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 22:39:43,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 22:39:43,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 22:39:43,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 22:39:43,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 22:39:43,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 22:39:43,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 22:39:43,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 22:39:43,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 22:39:43,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 22:39:43,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 22:39:43,480 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 22:39:43,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 22:39:43,484 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 22:39:43,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 22:39:43,489 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 22:39:43,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 22:39:43,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 22:39:43,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 22:39:43,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 22:39:43,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 22:39:43,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 22:39:43,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 22:39:43,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 22:39:43,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 22:39:43,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 22:39:43,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 22:39:43,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 22:39:43,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 22:39:43,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 22:39:43,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 22:39:43,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 22:39:43,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 22:39:43,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 22:39:43,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 22:39:43,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 22:39:43,507 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 22:39:43,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-22 22:39:43,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 22:39:43,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 22:39:43,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 22:39:43,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 22:39:43,540 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 22:39:43,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 22:39:43,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 22:39:43,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 22:39:43,541 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 22:39:43,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 22:39:43,542 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 22:39:43,542 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 22:39:43,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 22:39:43,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 22:39:43,543 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 22:39:43,543 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 22:39:43,543 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 22:39:43,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 22:39:43,544 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 22:39:43,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 22:39:43,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 22:39:43,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 22:39:43,544 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 22:39:43,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:39:43,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 22:39:43,545 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 22:39:43,545 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 22:39:43,545 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 22:39:43,545 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 22:39:43,546 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 22:39:43,546 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 22:39:43,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 22:39:43,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 22:39:43,546 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 70a2ace6fc40caa55e586c636402c0a5dfab1c8b77b7cf0fdf6a2120173a773c [2022-07-22 22:39:43,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 22:39:43,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 22:39:43,827 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 22:39:43,828 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 22:39:43,828 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 22:39:43,829 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-22 22:39:43,901 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566fa26fe/4e81ad9c3f3f42509e05fd1488d3f511/FLAG1476036be [2022-07-22 22:39:44,662 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 22:39:44,663 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-22 22:39:44,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566fa26fe/4e81ad9c3f3f42509e05fd1488d3f511/FLAG1476036be [2022-07-22 22:39:44,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/566fa26fe/4e81ad9c3f3f42509e05fd1488d3f511 [2022-07-22 22:39:44,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 22:39:44,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 22:39:44,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 22:39:44,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 22:39:44,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 22:39:44,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:39:44" (1/1) ... [2022-07-22 22:39:44,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48b5b6e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:44, skipping insertion in model container [2022-07-22 22:39:44,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 10:39:44" (1/1) ... [2022-07-22 22:39:44,777 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 22:39:44,896 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:39:45,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-22 22:39:46,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:39:46,087 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-22 22:39:46,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 22:39:46,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-22 22:39:46,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:39:46,432 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 22:39:46,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-net-usb-catc.ko.cil.out.i[199632,199645] [2022-07-22 22:39:46,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 22:39:46,850 INFO L208 MainTranslator]: Completed translation [2022-07-22 22:39:46,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46 WrapperNode [2022-07-22 22:39:46,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 22:39:46,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 22:39:46,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 22:39:46,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 22:39:46,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:46,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:46,997 INFO L137 Inliner]: procedures = 157, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1605 [2022-07-22 22:39:46,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 22:39:46,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 22:39:46,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 22:39:47,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 22:39:47,006 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:47,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:47,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:47,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:47,079 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:47,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:47,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:47,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 22:39:47,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 22:39:47,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 22:39:47,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 22:39:47,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (1/1) ... [2022-07-22 22:39:47,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 22:39:47,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 22:39:47,173 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-22 22:39:47,190 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-22 22:39:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-22 22:39:47,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-22 22:39:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-22 22:39:47,203 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-22 22:39:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-22 22:39:47,203 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-22 22:39:47,204 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-22 22:39:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-22 22:39:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 22:39:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-22 22:39:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-22 22:39:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-22 22:39:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-22 22:39:47,204 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-22 22:39:47,204 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-22 22:39:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-22 22:39:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-22 22:39:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-22 22:39:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-22 22:39:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-22 22:39:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-22 22:39:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-22 22:39:47,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-22 22:39:47,205 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-22 22:39:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-22 22:39:47,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-22 22:39:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-22 22:39:47,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-22 22:39:47,206 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-22 22:39:47,206 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-22 22:39:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-22 22:39:47,207 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-22 22:39:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-22 22:39:47,207 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-22 22:39:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-22 22:39:47,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-22 22:39:47,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-22 22:39:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-22 22:39:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-22 22:39:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-22 22:39:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-22 22:39:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-22 22:39:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-22 22:39:47,208 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-22 22:39:47,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-22 22:39:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-22 22:39:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-22 22:39:47,209 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-22 22:39:47,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 22:39:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-22 22:39:47,210 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-22 22:39:47,210 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-22 22:39:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-22 22:39:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-22 22:39:47,211 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-22 22:39:47,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 22:39:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 22:39:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 22:39:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-22 22:39:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-22 22:39:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-22 22:39:47,212 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-22 22:39:47,212 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-22 22:39:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 22:39:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-22 22:39:47,213 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-22 22:39:47,213 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-22 22:39:47,213 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-22 22:39:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-22 22:39:47,214 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-22 22:39:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-22 22:39:47,214 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-22 22:39:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-22 22:39:47,214 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-22 22:39:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-22 22:39:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-22 22:39:47,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-22 22:39:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-22 22:39:47,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-22 22:39:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 22:39:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 22:39:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 22:39:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-22 22:39:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 22:39:47,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-22 22:39:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-22 22:39:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-22 22:39:47,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-22 22:39:47,216 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-22 22:39:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-22 22:39:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-22 22:39:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-22 22:39:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-22 22:39:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-22 22:39:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-22 22:39:47,217 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-22 22:39:47,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-22 22:39:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-22 22:39:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-22 22:39:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-22 22:39:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-22 22:39:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-22 22:39:47,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 22:39:47,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 22:39:47,487 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 22:39:47,489 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 22:39:58,290 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-22 22:39:58,471 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 22:39:58,484 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-22 22:40:10,665 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-22 22:40:10,666 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-22 22:40:10,666 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-22 22:40:10,666 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-22 22:40:10,705 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 22:40:10,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 22:40:10,719 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-22 22:40:10,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:40:10 BoogieIcfgContainer [2022-07-22 22:40:10,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 22:40:10,724 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 22:40:10,725 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 22:40:10,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 22:40:10,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 10:39:44" (1/3) ... [2022-07-22 22:40:10,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694a693f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:40:10, skipping insertion in model container [2022-07-22 22:40:10,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 10:39:46" (2/3) ... [2022-07-22 22:40:10,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694a693f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 10:40:10, skipping insertion in model container [2022-07-22 22:40:10,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 10:40:10" (3/3) ... [2022-07-22 22:40:10,733 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-22 22:40:10,742 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 22:40:10,742 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 22:40:10,806 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 22:40:10,811 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@64c3360f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12bf157f [2022-07-22 22:40:10,811 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 22:40:10,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 539 states, 380 states have (on average 1.381578947368421) internal successors, (525), 393 states have internal predecessors, (525), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) [2022-07-22 22:40:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 22:40:10,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:40:10,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:40:10,825 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:40:10,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:40:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2022-07-22 22:40:10,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:40:10,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451592993] [2022-07-22 22:40:10,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:40:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:40:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:40:10,843 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:40:10,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 22:40:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:40:11,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 22:40:11,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:40:11,403 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-22 22:40:11,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:40:11,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:40:11,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451592993] [2022-07-22 22:40:11,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451592993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:40:11,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:40:11,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:40:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473481522] [2022-07-22 22:40:11,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:40:11,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:40:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:40:11,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:40:11,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:40:11,457 INFO L87 Difference]: Start difference. First operand has 539 states, 380 states have (on average 1.381578947368421) internal successors, (525), 393 states have internal predecessors, (525), 122 states have call successors, (122), 36 states have call predecessors, (122), 35 states have return successors, (121), 120 states have call predecessors, (121), 121 states have call successors, (121) Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-22 22:40:11,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:40:11,655 INFO L93 Difference]: Finished difference Result 1076 states and 1560 transitions. [2022-07-22 22:40:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 22:40:11,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-22 22:40:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:40:11,668 INFO L225 Difference]: With dead ends: 1076 [2022-07-22 22:40:11,668 INFO L226 Difference]: Without dead ends: 540 [2022-07-22 22:40:11,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:40:11,675 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 301 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3140 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:40:11,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 3140 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:40:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-22 22:40:11,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2022-07-22 22:40:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 378 states have (on average 1.216931216931217) internal successors, (460), 386 states have internal predecessors, (460), 121 states have call successors, (121), 35 states have call predecessors, (121), 35 states have return successors, (119), 118 states have call predecessors, (119), 118 states have call successors, (119) [2022-07-22 22:40:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 700 transitions. [2022-07-22 22:40:11,727 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 700 transitions. Word has length 17 [2022-07-22 22:40:11,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:40:11,727 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 700 transitions. [2022-07-22 22:40:11,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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-22 22:40:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 700 transitions. [2022-07-22 22:40:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 22:40:11,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:40:11,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:40:11,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 22:40:11,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:40:11,943 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:40:11,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:40:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1736454649, now seen corresponding path program 1 times [2022-07-22 22:40:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:40:11,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043741969] [2022-07-22 22:40:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:40:11,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:40:11,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:40:11,946 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:40:11,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 22:40:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:40:12,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 22:40:12,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:40:12,449 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-22 22:40:12,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:40:12,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:40:12,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043741969] [2022-07-22 22:40:12,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043741969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:40:12,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:40:12,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 22:40:12,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431035784] [2022-07-22 22:40:12,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:40:12,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:40:12,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:40:12,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:40:12,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:40:12,451 INFO L87 Difference]: Start difference. First operand 535 states and 700 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-22 22:40:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:40:12,516 INFO L93 Difference]: Finished difference Result 1565 states and 2072 transitions. [2022-07-22 22:40:12,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:40:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-22 22:40:12,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:40:12,522 INFO L225 Difference]: With dead ends: 1565 [2022-07-22 22:40:12,522 INFO L226 Difference]: Without dead ends: 1048 [2022-07-22 22:40:12,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-22 22:40:12,524 INFO L413 NwaCegarLoop]: 973 mSDtfsCounter, 676 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1649 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-22 22:40:12,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1649 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:40:12,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-07-22 22:40:12,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1045. [2022-07-22 22:40:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 738 states have (on average 1.2168021680216803) internal successors, (898), 751 states have internal predecessors, (898), 238 states have call successors, (238), 68 states have call predecessors, (238), 68 states have return successors, (240), 234 states have call predecessors, (240), 235 states have call successors, (240) [2022-07-22 22:40:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1376 transitions. [2022-07-22 22:40:12,566 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1376 transitions. Word has length 17 [2022-07-22 22:40:12,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:40:12,566 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1376 transitions. [2022-07-22 22:40:12,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 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-22 22:40:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1376 transitions. [2022-07-22 22:40:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 22:40:12,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:40:12,567 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-22 22:40:12,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 22:40:12,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:40:12,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:40:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:40:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2004221234, now seen corresponding path program 1 times [2022-07-22 22:40:12,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:40:12,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434541824] [2022-07-22 22:40:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:40:12,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:40:12,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:40:12,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:40:12,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 22:40:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:40:13,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 22:40:13,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:40:13,270 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-22 22:40:13,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:40:13,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:40:13,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434541824] [2022-07-22 22:40:13,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434541824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:40:13,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:40:13,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 22:40:13,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042057251] [2022-07-22 22:40:13,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:40:13,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:40:13,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:40:13,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:40:13,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:40:13,272 INFO L87 Difference]: Start difference. First operand 1045 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-22 22:40:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:40:13,291 INFO L93 Difference]: Finished difference Result 1047 states and 1377 transitions. [2022-07-22 22:40:13,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:40:13,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-22 22:40:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:40:13,295 INFO L225 Difference]: With dead ends: 1047 [2022-07-22 22:40:13,295 INFO L226 Difference]: Without dead ends: 1036 [2022-07-22 22:40:13,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-22 22:40:13,296 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 678 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:40:13,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:40:13,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-07-22 22:40:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1031. [2022-07-22 22:40:13,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 728 states have (on average 1.2115384615384615) internal successors, (882), 739 states have internal predecessors, (882), 236 states have call successors, (236), 67 states have call predecessors, (236), 66 states have return successors, (238), 232 states have call predecessors, (238), 234 states have call successors, (238) [2022-07-22 22:40:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2022-07-22 22:40:13,346 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2022-07-22 22:40:13,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:40:13,346 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2022-07-22 22:40:13,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 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-22 22:40:13,347 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2022-07-22 22:40:13,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-22 22:40:13,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:40:13,349 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] [2022-07-22 22:40:13,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-22 22:40:13,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:40:13,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:40:13,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:40:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2022-07-22 22:40:13,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:40:13,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256193533] [2022-07-22 22:40:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:40:13,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:40:13,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:40:13,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:40:13,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 22:40:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:40:14,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 22:40:14,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:40:14,090 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-22 22:40:14,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:40:14,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:40:14,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256193533] [2022-07-22 22:40:14,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256193533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:40:14,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:40:14,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 22:40:14,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913693396] [2022-07-22 22:40:14,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:40:14,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 22:40:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:40:14,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 22:40:14,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 22:40:14,091 INFO L87 Difference]: Start difference. First operand 1031 states and 1356 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:40:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:40:14,156 INFO L93 Difference]: Finished difference Result 2353 states and 3158 transitions. [2022-07-22 22:40:14,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 22:40:14,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 50 [2022-07-22 22:40:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:40:14,162 INFO L225 Difference]: With dead ends: 2353 [2022-07-22 22:40:14,162 INFO L226 Difference]: Without dead ends: 1334 [2022-07-22 22:40:14,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-22 22:40:14,165 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 262 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 22:40:14,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 1302 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 22:40:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-07-22 22:40:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1330. [2022-07-22 22:40:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2338624338624338) internal successors, (1166), 964 states have internal predecessors, (1166), 318 states have call successors, (318), 67 states have call predecessors, (318), 66 states have return successors, (320), 312 states have call predecessors, (320), 316 states have call successors, (320) [2022-07-22 22:40:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2022-07-22 22:40:14,198 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2022-07-22 22:40:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:40:14,198 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2022-07-22 22:40:14,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 22:40:14,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2022-07-22 22:40:14,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-22 22:40:14,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:40:14,202 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-22 22:40:14,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-22 22:40:14,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:40:14,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:40:14,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:40:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2022-07-22 22:40:14,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:40:14,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108373712] [2022-07-22 22:40:14,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:40:14,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:40:14,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:40:14,421 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:40:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-22 22:40:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:40:14,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:40:14,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:40:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:40:14,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:40:14,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:40:14,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108373712] [2022-07-22 22:40:14,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108373712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:40:14,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:40:14,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:40:14,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085335287] [2022-07-22 22:40:14,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:40:14,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:40:14,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:40:14,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:40:14,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:40:14,967 INFO L87 Difference]: Start difference. First operand 1330 states and 1804 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 22:40:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:40:15,143 INFO L93 Difference]: Finished difference Result 2669 states and 3616 transitions. [2022-07-22 22:40:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:40:15,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 72 [2022-07-22 22:40:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:40:15,148 INFO L225 Difference]: With dead ends: 2669 [2022-07-22 22:40:15,148 INFO L226 Difference]: Without dead ends: 1343 [2022-07-22 22:40:15,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:40:15,152 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 12 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2075 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:40:15,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2075 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:40:15,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-07-22 22:40:15,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1333. [2022-07-22 22:40:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1333 states, 947 states have (on average 1.232312565997888) internal successors, (1167), 967 states have internal predecessors, (1167), 318 states have call successors, (318), 68 states have call predecessors, (318), 67 states have return successors, (319), 311 states have call predecessors, (319), 315 states have call successors, (319) [2022-07-22 22:40:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2022-07-22 22:40:15,180 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 72 [2022-07-22 22:40:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:40:15,181 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2022-07-22 22:40:15,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 22:40:15,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2022-07-22 22:40:15,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-22 22:40:15,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:40:15,183 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:40:15,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-22 22:40:15,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:40:15,400 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:40:15,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:40:15,400 INFO L85 PathProgramCache]: Analyzing trace with hash -84772232, now seen corresponding path program 1 times [2022-07-22 22:40:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:40:15,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084621573] [2022-07-22 22:40:15,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:40:15,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:40:15,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:40:15,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:40:15,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-22 22:40:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:40:15,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 22:40:15,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:40:16,043 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 22:40:16,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:40:16,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:40:16,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084621573] [2022-07-22 22:40:16,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084621573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:40:16,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:40:16,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 22:40:16,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827802420] [2022-07-22 22:40:16,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:40:16,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 22:40:16,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:40:16,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 22:40:16,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 22:40:16,045 INFO L87 Difference]: Start difference. First operand 1333 states and 1804 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 22:40:16,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:40:16,237 INFO L93 Difference]: Finished difference Result 2675 states and 3616 transitions. [2022-07-22 22:40:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 22:40:16,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 80 [2022-07-22 22:40:16,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:40:16,243 INFO L225 Difference]: With dead ends: 2675 [2022-07-22 22:40:16,243 INFO L226 Difference]: Without dead ends: 1346 [2022-07-22 22:40:16,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 22:40:16,247 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 12 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:40:16,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2062 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:40:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-07-22 22:40:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1330. [2022-07-22 22:40:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2317460317460318) internal successors, (1164), 966 states have internal predecessors, (1164), 317 states have call successors, (317), 68 states have call predecessors, (317), 67 states have return successors, (317), 309 states have call predecessors, (317), 313 states have call successors, (317) [2022-07-22 22:40:16,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2022-07-22 22:40:16,280 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 80 [2022-07-22 22:40:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:40:16,281 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2022-07-22 22:40:16,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-22 22:40:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2022-07-22 22:40:16,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-22 22:40:16,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:40:16,283 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 22:40:16,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-22 22:40:16,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:40:16,504 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:40:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:40:16,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2022-07-22 22:40:16,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:40:16,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738532956] [2022-07-22 22:40:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:40:16,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:40:16,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:40:16,510 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:40:16,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-22 22:40:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:40:17,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 22:40:17,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:40:17,264 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-22 22:40:17,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:40:17,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:40:17,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738532956] [2022-07-22 22:40:17,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1738532956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:40:17,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:40:17,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 22:40:17,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34288486] [2022-07-22 22:40:17,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:40:17,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-22 22:40:17,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:40:17,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 22:40:17,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-22 22:40:17,266 INFO L87 Difference]: Start difference. First operand 1330 states and 1798 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:40:18,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:40:18,082 INFO L93 Difference]: Finished difference Result 2671 states and 3615 transitions. [2022-07-22 22:40:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:40:18,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 146 [2022-07-22 22:40:18,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:40:18,088 INFO L225 Difference]: With dead ends: 2671 [2022-07-22 22:40:18,088 INFO L226 Difference]: Without dead ends: 1351 [2022-07-22 22:40:18,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:40:18,092 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 13 mSDsluCounter, 2777 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3479 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:40:18,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 3479 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-22 22:40:18,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-22 22:40:18,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2022-07-22 22:40:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 950 states have (on average 1.2305263157894737) internal successors, (1169), 972 states have internal predecessors, (1169), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-07-22 22:40:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1808 transitions. [2022-07-22 22:40:18,122 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1808 transitions. Word has length 146 [2022-07-22 22:40:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:40:18,122 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1808 transitions. [2022-07-22 22:40:18,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-22 22:40:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1808 transitions. [2022-07-22 22:40:18,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-22 22:40:18,124 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:40:18,124 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 22:40:18,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-22 22:40:18,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:40:18,346 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:40:18,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:40:18,346 INFO L85 PathProgramCache]: Analyzing trace with hash 971530265, now seen corresponding path program 1 times [2022-07-22 22:40:18,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:40:18,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485467938] [2022-07-22 22:40:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:40:18,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:40:18,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:40:18,356 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:40:18,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-22 22:40:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:40:19,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 22:40:19,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:40:19,241 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 19 treesize of output 7 [2022-07-22 22:40:19,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-22 22:40:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-22 22:40:19,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:40:19,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:40:19,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485467938] [2022-07-22 22:40:19,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485467938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:40:19,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:40:19,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:40:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393191092] [2022-07-22 22:40:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:40:19,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:40:19,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:40:19,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:40:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:40:19,349 INFO L87 Difference]: Start difference. First operand 1337 states and 1808 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-22 22:40:21,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:22,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:24,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:26,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:28,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:30,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:32,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:34,520 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:37,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:39,026 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:42,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:44,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:46,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:48,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:50,243 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:52,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:54,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:56,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:40:58,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:00,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:01,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:02,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:41:03,696 INFO L93 Difference]: Finished difference Result 1399 states and 1888 transitions. [2022-07-22 22:41:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:41:03,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 146 [2022-07-22 22:41:03,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:41:03,702 INFO L225 Difference]: With dead ends: 1399 [2022-07-22 22:41:03,702 INFO L226 Difference]: Without dead ends: 1339 [2022-07-22 22:41:03,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:41:03,711 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.2s IncrementalHoareTripleChecker+Time [2022-07-22 22:41:03,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3863 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 12 Unknown, 0 Unchecked, 44.2s Time] [2022-07-22 22:41:03,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-22 22:41:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2022-07-22 22:41:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 950 states have (on average 1.2284210526315789) internal successors, (1167), 972 states have internal predecessors, (1167), 317 states have call successors, (317), 68 states have call predecessors, (317), 69 states have return successors, (322), 310 states have call predecessors, (322), 313 states have call successors, (322) [2022-07-22 22:41:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2022-07-22 22:41:03,805 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 146 [2022-07-22 22:41:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:41:03,805 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2022-07-22 22:41:03,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-22 22:41:03,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2022-07-22 22:41:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:41:03,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:41:03,809 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-22 22:41:03,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-22 22:41:04,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:41:04,032 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:41:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:41:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2022-07-22 22:41:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:41:04,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281910187] [2022-07-22 22:41:04,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:41:04,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:41:04,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:41:04,034 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:41:04,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-22 22:41:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:41:09,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 22:41:09,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:41:09,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:41:09,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-22 22:41:09,662 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 22:41:09,662 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 23 treesize of output 22 [2022-07-22 22:41:09,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:41:09,681 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 23 treesize of output 22 [2022-07-22 22:41:10,086 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-22 22:41:10,086 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 23 treesize of output 22 [2022-07-22 22:41:10,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 22:41:10,105 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 23 treesize of output 22 [2022-07-22 22:41:10,422 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 19 treesize of output 7 [2022-07-22 22:41:10,428 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 19 treesize of output 7 [2022-07-22 22:41:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-07-22 22:41:10,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:41:10,718 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-22 22:41:10,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:41:10,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281910187] [2022-07-22 22:41:10,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281910187] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:41:10,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:41:10,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-07-22 22:41:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448762595] [2022-07-22 22:41:10,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:41:10,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:41:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:41:10,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:41:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:41:10,719 INFO L87 Difference]: Start difference. First operand 1337 states and 1806 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 22:41:12,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:14,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:17,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:19,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:21,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:23,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:25,088 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:27,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:29,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:31,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:33,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:41:33,632 INFO L93 Difference]: Finished difference Result 2386 states and 3197 transitions. [2022-07-22 22:41:33,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 22:41:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 147 [2022-07-22 22:41:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:41:33,637 INFO L225 Difference]: With dead ends: 2386 [2022-07-22 22:41:33,638 INFO L226 Difference]: Without dead ends: 1008 [2022-07-22 22:41:33,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-22 22:41:33,642 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 2 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 22.8s IncrementalHoareTripleChecker+Time [2022-07-22 22:41:33,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3974 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 9 Unknown, 101 Unchecked, 22.8s Time] [2022-07-22 22:41:33,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-07-22 22:41:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-07-22 22:41:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 717 states have (on average 1.2259414225941423) internal successors, (879), 734 states have internal predecessors, (879), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 221 states have call predecessors, (231), 224 states have call successors, (231) [2022-07-22 22:41:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2022-07-22 22:41:33,703 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2022-07-22 22:41:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:41:33,704 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2022-07-22 22:41:33,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-22 22:41:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2022-07-22 22:41:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:41:33,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:41:33,706 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2022-07-22 22:41:33,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-22 22:41:33,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:41:33,923 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:41:33,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:41:33,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2022-07-22 22:41:33,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:41:33,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342373545] [2022-07-22 22:41:33,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 22:41:33,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:41:33,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:41:33,926 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:41:33,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-22 22:41:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 22:41:34,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 22:41:34,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:41:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-07-22 22:41:34,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 22:41:34,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:41:34,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342373545] [2022-07-22 22:41:34,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342373545] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 22:41:34,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 22:41:34,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 22:41:34,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497197228] [2022-07-22 22:41:34,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 22:41:34,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-22 22:41:34,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:41:34,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-22 22:41:34,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:41:34,857 INFO L87 Difference]: Start difference. First operand 1008 states and 1336 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:41:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 22:41:34,938 INFO L93 Difference]: Finished difference Result 1696 states and 2271 transitions. [2022-07-22 22:41:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 22:41:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) Word has length 147 [2022-07-22 22:41:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 22:41:34,943 INFO L225 Difference]: With dead ends: 1696 [2022-07-22 22:41:34,943 INFO L226 Difference]: Without dead ends: 1011 [2022-07-22 22:41:34,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-22 22:41:34,946 INFO L413 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 3436 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4125 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 22:41:34,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4125 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 22:41:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-07-22 22:41:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-07-22 22:41:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 720 states have (on average 1.2236111111111112) internal successors, (881), 735 states have internal predecessors, (881), 226 states have call successors, (226), 63 states have call predecessors, (226), 64 states have return successors, (231), 223 states have call predecessors, (231), 224 states have call successors, (231) [2022-07-22 22:41:34,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2022-07-22 22:41:34,994 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 147 [2022-07-22 22:41:34,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 22:41:34,994 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2022-07-22 22:41:34,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (15), 4 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-22 22:41:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2022-07-22 22:41:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-22 22:41:34,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 22:41:34,996 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2022-07-22 22:41:35,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-22 22:41:35,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 22:41:35,220 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 22:41:35,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 22:41:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash 345028375, now seen corresponding path program 2 times [2022-07-22 22:41:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 22:41:35,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368890706] [2022-07-22 22:41:35,221 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 22:41:35,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 22:41:35,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 22:41:35,222 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 22:41:35,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-22 22:41:36,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 22:41:36,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 22:41:36,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-22 22:41:36,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 22:41:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-07-22 22:41:37,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 22:41:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-22 22:41:38,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 22:41:38,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368890706] [2022-07-22 22:41:38,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368890706] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 22:41:38,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 22:41:38,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-07-22 22:41:38,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724258011] [2022-07-22 22:41:38,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 22:41:38,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 22:41:38,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 22:41:38,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 22:41:38,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-22 22:41:38,230 INFO L87 Difference]: Start difference. First operand 1011 states and 1338 transitions. Second operand has 11 states, 11 states have (on average 13.181818181818182) internal successors, (145), 11 states have internal predecessors, (145), 9 states have call successors, (29), 8 states have call predecessors, (29), 6 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2022-07-22 22:41:40,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:42,653 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:44,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:47,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:49,385 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:51,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:53,095 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:55,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:57,168 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:41:58,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:00,578 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:02,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:05,509 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:07,234 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:11,114 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:13,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:15,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:17,336 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:19,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:21,366 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:24,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:26,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:28,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:30,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:32,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:34,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:36,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:38,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:41,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 22:42:43,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []