./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 f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.0/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-?-f4b24e3 [2022-07-13 23:02:24,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:02:24,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:02:24,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:02:24,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:02:24,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:02:24,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:02:24,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:02:24,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:02:24,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:02:24,354 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:02:24,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:02:24,356 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:02:24,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:02:24,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:02:24,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:02:24,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:02:24,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:02:24,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:02:24,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:02:24,368 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:02:24,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:02:24,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:02:24,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:02:24,371 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:02:24,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:02:24,376 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:02:24,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:02:24,377 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:02:24,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:02:24,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:02:24,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:02:24,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:02:24,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:02:24,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:02:24,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:02:24,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:02:24,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:02:24,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:02:24,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:02:24,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:02:24,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:02:24,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 23:02:24,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:02:24,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:02:24,413 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:02:24,413 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:02:24,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:02:24,414 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:02:24,414 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:02:24,414 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:02:24,414 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:02:24,415 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:02:24,415 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 23:02:24,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:02:24,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:02:24,416 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:02:24,416 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:02:24,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:02:24,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:02:24,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:02:24,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:02:24,417 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:02:24,417 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:02:24,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:02:24,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:02:24,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:02:24,417 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:02:24,417 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 23:02:24,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 23:02:24,418 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:02:24,418 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:02:24,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:02:24,418 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-13 23:02:24,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:02:24,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:02:24,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:02:24,636 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:02:24,637 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:02:24,638 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-13 23:02:24,685 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff73fc5f0/f83ba3a36dbb46f38d498dc200168ccd/FLAG33979d3ec [2022-07-13 23:02:25,238 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:02:25,238 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-13 23:02:25,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff73fc5f0/f83ba3a36dbb46f38d498dc200168ccd/FLAG33979d3ec [2022-07-13 23:02:25,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff73fc5f0/f83ba3a36dbb46f38d498dc200168ccd [2022-07-13 23:02:25,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:02:25,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:02:25,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:02:25,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:02:25,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:02:25,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:02:25" (1/1) ... [2022-07-13 23:02:25,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c3f173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:25, skipping insertion in model container [2022-07-13 23:02:25,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:02:25" (1/1) ... [2022-07-13 23:02:25,442 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:02:25,505 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:02:26,267 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-13 23:02:26,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:02:26,325 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:02:26,492 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-13 23:02:26,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:02:26,655 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:02:26,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26 WrapperNode [2022-07-13 23:02:26,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:02:26,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:02:26,657 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:02:26,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:02:26,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,786 INFO L137 Inliner]: procedures = 142, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1679 [2022-07-13 23:02:26,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:02:26,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:02:26,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:02:26,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:02:26,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,794 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:02:26,942 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:02:26,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:02:26,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:02:26,956 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (1/1) ... [2022-07-13 23:02:26,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:02:26,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:27,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 23:02:27,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 23:02:27,039 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-13 23:02:27,039 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-13 23:02:27,039 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-13 23:02:27,040 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-13 23:02:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-13 23:02:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-13 23:02:27,040 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-13 23:02:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 23:02:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 23:02:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 23:02:27,040 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-13 23:02:27,040 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-13 23:02:27,041 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-13 23:02:27,041 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-13 23:02:27,041 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-13 23:02:27,041 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-13 23:02:27,041 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-13 23:02:27,041 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-13 23:02:27,041 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-13 23:02:27,041 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-13 23:02:27,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-13 23:02:27,042 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-13 23:02:27,042 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-13 23:02:27,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-13 23:02:27,042 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:02:27,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:02:27,042 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-13 23:02:27,042 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-13 23:02:27,042 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-13 23:02:27,043 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-13 23:02:27,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 23:02:27,043 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-13 23:02:27,043 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-13 23:02:27,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-13 23:02:27,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-13 23:02:27,043 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-13 23:02:27,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-13 23:02:27,043 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-13 23:02:27,044 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-13 23:02:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 23:02:27,044 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 23:02:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-13 23:02:27,044 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-13 23:02:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:02:27,044 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-13 23:02:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-13 23:02:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-13 23:02:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-13 23:02:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-13 23:02:27,045 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-13 23:02:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:02:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:02:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:02:27,045 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-13 23:02:27,046 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-13 23:02:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:02:27,046 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-13 23:02:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-13 23:02:27,047 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-13 23:02:27,047 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-13 23:02:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-13 23:02:27,048 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-13 23:02:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-13 23:02:27,048 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-13 23:02:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-13 23:02:27,048 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-13 23:02:27,048 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-13 23:02:27,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-13 23:02:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:02:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:02:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-13 23:02:27,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-13 23:02:27,049 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-13 23:02:27,050 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-13 23:02:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-13 23:02:27,050 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-13 23:02:27,050 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-13 23:02:27,051 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-13 23:02:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-13 23:02:27,051 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-13 23:02:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-13 23:02:27,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-13 23:02:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 23:02:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-13 23:02:27,051 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-13 23:02:27,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-13 23:02:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-13 23:02:27,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:02:27,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:02:27,367 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:02:27,368 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:02:27,881 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-13 23:02:27,918 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:02:27,924 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:02:28,573 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-13 23:02:28,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-13 23:02:28,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-13 23:02:28,574 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-13 23:02:28,587 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:02:28,594 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:02:28,594 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-13 23:02:28,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:28 BoogieIcfgContainer [2022-07-13 23:02:28,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:02:28,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:02:28,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:02:28,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:02:28,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:02:25" (1/3) ... [2022-07-13 23:02:28,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7fdcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:02:28, skipping insertion in model container [2022-07-13 23:02:28,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:02:26" (2/3) ... [2022-07-13 23:02:28,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e7fdcce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:02:28, skipping insertion in model container [2022-07-13 23:02:28,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:28" (3/3) ... [2022-07-13 23:02:28,602 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-13 23:02:28,610 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:02:28,610 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:02:28,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:02:28,672 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@2129fc51, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5650082e [2022-07-13 23:02:28,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:02:28,677 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-13 23:02:28,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 23:02:28,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:28,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:28,682 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:28,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:28,685 INFO L85 PathProgramCache]: Analyzing trace with hash -701775118, now seen corresponding path program 1 times [2022-07-13 23:02:28,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:28,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521173698] [2022-07-13 23:02:28,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:28,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:28,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:29,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:29,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521173698] [2022-07-13 23:02:29,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521173698] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:29,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:29,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:02:29,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663213332] [2022-07-13 23:02:29,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:29,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:02:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:02:29,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:02:29,053 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-13 23:02:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:29,182 INFO L93 Difference]: Finished difference Result 1092 states and 1610 transitions. [2022-07-13 23:02:29,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:02:29,189 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-13 23:02:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:29,199 INFO L225 Difference]: With dead ends: 1092 [2022-07-13 23:02:29,202 INFO L226 Difference]: Without dead ends: 548 [2022-07-13 23:02:29,225 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-13 23:02:29,228 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-13 23:02:29,229 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-13 23:02:29,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-13 23:02:29,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 543. [2022-07-13 23:02:29,306 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-13 23:02:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 710 transitions. [2022-07-13 23:02:29,312 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 710 transitions. Word has length 17 [2022-07-13 23:02:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:29,313 INFO L495 AbstractCegarLoop]: Abstraction has 543 states and 710 transitions. [2022-07-13 23:02:29,313 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-13 23:02:29,313 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 710 transitions. [2022-07-13 23:02:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 23:02:29,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:29,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:02:29,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 23:02:29,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:29,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1094802128, now seen corresponding path program 1 times [2022-07-13 23:02:29,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:29,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169845364] [2022-07-13 23:02:29,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:29,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,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-13 23:02:29,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:29,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169845364] [2022-07-13 23:02:29,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169845364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:29,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:29,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:02:29,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114649403] [2022-07-13 23:02:29,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:29,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:29,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:29,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:29,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:02:29,406 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-13 23:02:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:29,447 INFO L93 Difference]: Finished difference Result 1589 states and 2102 transitions. [2022-07-13 23:02:29,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:29,447 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-13 23:02:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:29,453 INFO L225 Difference]: With dead ends: 1589 [2022-07-13 23:02:29,453 INFO L226 Difference]: Without dead ends: 1064 [2022-07-13 23:02:29,454 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-13 23:02:29,455 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-13 23:02:29,456 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-13 23:02:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2022-07-13 23:02:29,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1061. [2022-07-13 23:02:29,484 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-13 23:02:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1396 transitions. [2022-07-13 23:02:29,488 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1396 transitions. Word has length 17 [2022-07-13 23:02:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:29,489 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1396 transitions. [2022-07-13 23:02:29,489 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-13 23:02:29,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1396 transitions. [2022-07-13 23:02:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 23:02:29,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:29,490 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-13 23:02:29,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 23:02:29,490 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:29,491 INFO L85 PathProgramCache]: Analyzing trace with hash 420612946, now seen corresponding path program 1 times [2022-07-13 23:02:29,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:29,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274580980] [2022-07-13 23:02:29,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:29,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:29,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:29,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274580980] [2022-07-13 23:02:29,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274580980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:29,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:29,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:02:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113249105] [2022-07-13 23:02:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:29,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:02:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:29,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:02:29,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:02:29,595 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-13 23:02:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:29,616 INFO L93 Difference]: Finished difference Result 1063 states and 1397 transitions. [2022-07-13 23:02:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:02:29,617 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-13 23:02:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:29,621 INFO L225 Difference]: With dead ends: 1063 [2022-07-13 23:02:29,621 INFO L226 Difference]: Without dead ends: 1052 [2022-07-13 23:02:29,621 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-13 23:02:29,622 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-13 23:02:29,623 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-13 23:02:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2022-07-13 23:02:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1047. [2022-07-13 23:02:29,651 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-13 23:02:29,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1376 transitions. [2022-07-13 23:02:29,656 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1376 transitions. Word has length 18 [2022-07-13 23:02:29,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:29,656 INFO L495 AbstractCegarLoop]: Abstraction has 1047 states and 1376 transitions. [2022-07-13 23:02:29,656 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-13 23:02:29,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1376 transitions. [2022-07-13 23:02:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 23:02:29,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:29,659 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-13 23:02:29,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 23:02:29,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash -42685748, now seen corresponding path program 1 times [2022-07-13 23:02:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:29,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853203946] [2022-07-13 23:02:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-13 23:02:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-13 23:02:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:02:29,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:29,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853203946] [2022-07-13 23:02:29,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853203946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:29,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:29,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:02:29,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699241007] [2022-07-13 23:02:29,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:29,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:02:29,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:29,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:02:29,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:02:29,758 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-13 23:02:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:30,603 INFO L93 Difference]: Finished difference Result 2403 states and 3232 transitions. [2022-07-13 23:02:30,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:02:30,604 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-13 23:02:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:30,610 INFO L225 Difference]: With dead ends: 2403 [2022-07-13 23:02:30,610 INFO L226 Difference]: Without dead ends: 1368 [2022-07-13 23:02:30,613 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-13 23:02:30,614 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 427 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:30,614 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.8s Time] [2022-07-13 23:02:30,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2022-07-13 23:02:30,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1346. [2022-07-13 23:02:30,644 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-13 23:02:30,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1824 transitions. [2022-07-13 23:02:30,649 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1824 transitions. Word has length 50 [2022-07-13 23:02:30,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:30,649 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1824 transitions. [2022-07-13 23:02:30,650 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-13 23:02:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1824 transitions. [2022-07-13 23:02:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 23:02:30,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:30,653 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-13 23:02:30,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-13 23:02:30,653 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1108217249, now seen corresponding path program 1 times [2022-07-13 23:02:30,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:30,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493127843] [2022-07-13 23:02:30,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:30,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-13 23:02:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 23:02:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:30,754 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-13 23:02:30,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:30,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493127843] [2022-07-13 23:02:30,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493127843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:30,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:02:30,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 23:02:30,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327151854] [2022-07-13 23:02:30,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:30,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 23:02:30,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:30,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 23:02:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 23:02:30,756 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-13 23:02:31,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:31,793 INFO L93 Difference]: Finished difference Result 2719 states and 3690 transitions. [2022-07-13 23:02:31,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:02:31,793 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-13 23:02:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:31,799 INFO L225 Difference]: With dead ends: 2719 [2022-07-13 23:02:31,799 INFO L226 Difference]: Without dead ends: 1374 [2022-07-13 23:02:31,802 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-13 23:02:31,803 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:31,803 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.0s Time] [2022-07-13 23:02:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-13 23:02:31,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1346. [2022-07-13 23:02:31,834 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-13 23:02:31,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1818 transitions. [2022-07-13 23:02:31,840 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1818 transitions. Word has length 72 [2022-07-13 23:02:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:31,840 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1818 transitions. [2022-07-13 23:02:31,840 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-13 23:02:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1818 transitions. [2022-07-13 23:02:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 23:02:31,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:31,843 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-13 23:02:31,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 23:02:31,843 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:31,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1223480200, now seen corresponding path program 1 times [2022-07-13 23:02:31,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:31,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72042582] [2022-07-13 23:02:31,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:31,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:02:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:02:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:02:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:02:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:02:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:02:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,131 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-13 23:02:32,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72042582] [2022-07-13 23:02:32,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72042582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:32,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96872633] [2022-07-13 23:02:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:32,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:32,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:32,134 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:32,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 23:02:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:32,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 23:02:32,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:32,638 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-13 23:02:32,641 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-13 23:02:32,695 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-13 23:02:32,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:32,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96872633] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:32,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:32,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-07-13 23:02:32,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612995572] [2022-07-13 23:02:32,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:32,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:02:32,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:32,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:02:32,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 23:02:32,696 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-13 23:02:33,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:33,642 INFO L93 Difference]: Finished difference Result 1408 states and 1898 transitions. [2022-07-13 23:02:33,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:02:33,643 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-13 23:02:33,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:33,648 INFO L225 Difference]: With dead ends: 1408 [2022-07-13 23:02:33,649 INFO L226 Difference]: Without dead ends: 1348 [2022-07-13 23:02:33,649 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-13 23:02:33,650 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-13 23:02:33,650 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-13 23:02:33,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2022-07-13 23:02:33,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1346. [2022-07-13 23:02:33,678 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-13 23:02:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1816 transitions. [2022-07-13 23:02:33,684 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1816 transitions. Word has length 146 [2022-07-13 23:02:33,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:33,684 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1816 transitions. [2022-07-13 23:02:33,685 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-13 23:02:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1816 transitions. [2022-07-13 23:02:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 23:02:33,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:33,687 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-13 23:02:33,723 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-13 23:02:33,908 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-13 23:02:33,909 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:33,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:33,909 INFO L85 PathProgramCache]: Analyzing trace with hash 193202081, now seen corresponding path program 1 times [2022-07-13 23:02:33,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:33,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053301962] [2022-07-13 23:02:33,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:02:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:02:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:02:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:02:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:02:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:02:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,191 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-13 23:02:34,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:34,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053301962] [2022-07-13 23:02:34,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053301962] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:34,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501200216] [2022-07-13 23:02:34,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:34,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:34,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:34,193 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:34,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 23:02:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:34,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 23:02:34,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:34,671 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-13 23:02:34,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:02:34,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501200216] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:02:34,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:02:34,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-13 23:02:34,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391749429] [2022-07-13 23:02:34,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:34,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:02:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:34,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:02:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:02:34,674 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-13 23:02:34,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:34,758 INFO L93 Difference]: Finished difference Result 2703 states and 3651 transitions. [2022-07-13 23:02:34,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:02:34,759 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-13 23:02:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:34,764 INFO L225 Difference]: With dead ends: 2703 [2022-07-13 23:02:34,764 INFO L226 Difference]: Without dead ends: 1367 [2022-07-13 23:02:34,768 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-13 23:02:34,769 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-13 23:02:34,769 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-13 23:02:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-07-13 23:02:34,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1353. [2022-07-13 23:02:34,800 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-13 23:02:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1826 transitions. [2022-07-13 23:02:34,804 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1826 transitions. Word has length 147 [2022-07-13 23:02:34,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:34,805 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1826 transitions. [2022-07-13 23:02:34,805 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-13 23:02:34,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1826 transitions. [2022-07-13 23:02:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 23:02:34,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:34,807 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-13 23:02:34,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:35,025 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-13 23:02:35,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:35,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:35,026 INFO L85 PathProgramCache]: Analyzing trace with hash -2120603136, now seen corresponding path program 1 times [2022-07-13 23:02:35,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:35,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853181191] [2022-07-13 23:02:35,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:35,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:02:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:02:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:35,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:02:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:02:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:02:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:02:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:35,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,352 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-13 23:02:35,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:35,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853181191] [2022-07-13 23:02:35,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853181191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:35,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716921996] [2022-07-13 23:02:35,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:35,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:35,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:35,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:35,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 23:02:35,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:35,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-13 23:02:35,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:35,864 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-13 23:02:35,870 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-13 23:02:35,996 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 23:02:35,997 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-13 23:02:36,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:36,002 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-13 23:02:36,121 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 23:02:36,122 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-13 23:02:36,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:36,128 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-13 23:02:36,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:36,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:36,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:36,390 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-13 23:02:36,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:36,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:36,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:36,400 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-13 23:02:36,427 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-13 23:02:36,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:36,612 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-13 23:02:36,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716921996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:02:36,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:02:36,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2022-07-13 23:02:36,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351727099] [2022-07-13 23:02:36,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:02:36,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 23:02:36,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:36,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 23:02:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2022-07-13 23:02:36,614 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-13 23:02:40,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:40,297 INFO L93 Difference]: Finished difference Result 2464 states and 3330 transitions. [2022-07-13 23:02:40,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-13 23:02:40,298 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-13 23:02:40,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:40,302 INFO L225 Difference]: With dead ends: 2464 [2022-07-13 23:02:40,302 INFO L226 Difference]: Without dead ends: 1032 [2022-07-13 23:02:40,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 317 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-07-13 23:02:40,306 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 170 mSDsluCounter, 3772 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 4475 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 422 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:40,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 4475 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2472 Invalid, 0 Unknown, 422 Unchecked, 3.5s Time] [2022-07-13 23:02:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2022-07-13 23:02:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1016. [2022-07-13 23:02:40,330 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-13 23:02:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 1346 transitions. [2022-07-13 23:02:40,333 INFO L78 Accepts]: Start accepts. Automaton has 1016 states and 1346 transitions. Word has length 147 [2022-07-13 23:02:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:40,333 INFO L495 AbstractCegarLoop]: Abstraction has 1016 states and 1346 transitions. [2022-07-13 23:02:40,334 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-13 23:02:40,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1016 states and 1346 transitions. [2022-07-13 23:02:40,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 23:02:40,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:40,335 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-13 23:02:40,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:40,574 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-13 23:02:40,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:40,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:40,575 INFO L85 PathProgramCache]: Analyzing trace with hash -339103201, now seen corresponding path program 1 times [2022-07-13 23:02:40,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:40,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416561354] [2022-07-13 23:02:40,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:40,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:02:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:02:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:02:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:02:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:40,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:02:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:02:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:40,888 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-13 23:02:40,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:40,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416561354] [2022-07-13 23:02:40,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416561354] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:40,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638948525] [2022-07-13 23:02:40,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:40,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:40,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:40,890 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:40,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 23:02:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:41,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 23:02:41,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:41,458 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-13 23:02:41,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:41,706 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-13 23:02:41,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638948525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:02:41,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:02:41,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2022-07-13 23:02:41,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565102395] [2022-07-13 23:02:41,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:02:41,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-13 23:02:41,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-13 23:02:41,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-13 23:02:41,708 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-13 23:02:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:46,428 INFO L93 Difference]: Finished difference Result 2099 states and 2804 transitions. [2022-07-13 23:02:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 23:02:46,429 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-13 23:02:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:46,434 INFO L225 Difference]: With dead ends: 2099 [2022-07-13 23:02:46,434 INFO L226 Difference]: Without dead ends: 1397 [2022-07-13 23:02:46,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2022-07-13 23:02:46,440 INFO L413 NwaCegarLoop]: 925 mSDtfsCounter, 2183 mSDsluCounter, 4045 mSDsCounter, 0 mSdLazyCounter, 4166 mSolverCounterSat, 1104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 4970 SdHoareTripleChecker+Invalid, 5270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1104 IncrementalHoareTripleChecker+Valid, 4166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:46,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 4970 Invalid, 5270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1104 Valid, 4166 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-13 23:02:46,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2022-07-13 23:02:46,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1372. [2022-07-13 23:02:46,479 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-13 23:02:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1823 transitions. [2022-07-13 23:02:46,482 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1823 transitions. Word has length 147 [2022-07-13 23:02:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:46,483 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1823 transitions. [2022-07-13 23:02:46,483 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-13 23:02:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1823 transitions. [2022-07-13 23:02:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 23:02:46,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:46,485 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-13 23:02:46,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:46,701 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-13 23:02:46,702 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:46,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:46,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1013490977, now seen corresponding path program 1 times [2022-07-13 23:02:46,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:46,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290962006] [2022-07-13 23:02:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:46,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:02:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:02:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:02:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:02:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:02:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:02:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-13 23:02:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:46,932 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-13 23:02:46,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:46,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290962006] [2022-07-13 23:02:46,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290962006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:46,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100545108] [2022-07-13 23:02:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:46,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:46,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:46,948 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:46,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 23:02:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:47,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 23:02:47,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:47,477 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-13 23:02:47,479 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-13 23:02:47,490 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-13 23:02:47,490 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:47,595 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-13 23:02:47,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100545108] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:47,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:02:47,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-13 23:02:47,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728732084] [2022-07-13 23:02:47,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:02:47,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:02:47,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:02:47,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:02:47,597 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-13 23:02:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:48,477 INFO L93 Difference]: Finished difference Result 1437 states and 1901 transitions. [2022-07-13 23:02:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:02:48,478 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-13 23:02:48,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:48,482 INFO L225 Difference]: With dead ends: 1437 [2022-07-13 23:02:48,482 INFO L226 Difference]: Without dead ends: 1372 [2022-07-13 23:02:48,483 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-13 23:02:48,483 INFO L413 NwaCegarLoop]: 698 mSDtfsCounter, 5 mSDsluCounter, 3225 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:48,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3923 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-13 23:02:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2022-07-13 23:02:48,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2022-07-13 23:02:48,512 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-13 23:02:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1822 transitions. [2022-07-13 23:02:48,515 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1822 transitions. Word has length 157 [2022-07-13 23:02:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:48,515 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1822 transitions. [2022-07-13 23:02:48,515 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-13 23:02:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1822 transitions. [2022-07-13 23:02:48,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-13 23:02:48,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:48,517 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-13 23:02:48,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 23:02:48,730 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-13 23:02:48,730 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:48,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:48,731 INFO L85 PathProgramCache]: Analyzing trace with hash -497932717, now seen corresponding path program 1 times [2022-07-13 23:02:48,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:48,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79549804] [2022-07-13 23:02:48,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:48,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:02:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:02:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:02:48,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:02:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:48,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:02:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:49,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:02:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 23:02:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,030 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-13 23:02:49,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:49,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79549804] [2022-07-13 23:02:49,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79549804] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:49,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972290990] [2022-07-13 23:02:49,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:49,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:49,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:49,048 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:49,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 23:02:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:49,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 1935 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-13 23:02:49,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:49,544 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-13 23:02:49,547 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-13 23:02:49,622 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 23:02:49,622 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-13 23:02:49,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:49,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, 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-13 23:02:49,783 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 23:02:49,784 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-13 23:02:49,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:02:49,789 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-13 23:02:49,827 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-13 23:02:49,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:49,984 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-13 23:02:49,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972290990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:02:49,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:02:49,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-07-13 23:02:49,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116594659] [2022-07-13 23:02:49,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:02:49,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 23:02:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:49,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 23:02:49,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-07-13 23:02:49,985 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-13 23:02:53,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:02:53,014 INFO L93 Difference]: Finished difference Result 2452 states and 3275 transitions. [2022-07-13 23:02:53,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-13 23:02:53,015 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-13 23:02:53,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:02:53,021 INFO L225 Difference]: With dead ends: 2452 [2022-07-13 23:02:53,021 INFO L226 Difference]: Without dead ends: 1374 [2022-07-13 23:02:53,024 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-13 23:02:53,025 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 173 mSDsluCounter, 3400 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 4093 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 416 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:02:53,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 4093 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2517 Invalid, 0 Unknown, 416 Unchecked, 2.9s Time] [2022-07-13 23:02:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2022-07-13 23:02:53,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1372. [2022-07-13 23:02:53,064 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-13 23:02:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1821 transitions. [2022-07-13 23:02:53,069 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1821 transitions. Word has length 158 [2022-07-13 23:02:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:02:53,069 INFO L495 AbstractCegarLoop]: Abstraction has 1372 states and 1821 transitions. [2022-07-13 23:02:53,070 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-13 23:02:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1821 transitions. [2022-07-13 23:02:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-13 23:02:53,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:02:53,071 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-13 23:02:53,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-13 23:02:53,287 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-13 23:02:53,287 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:02:53,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:02:53,288 INFO L85 PathProgramCache]: Analyzing trace with hash 865652627, now seen corresponding path program 1 times [2022-07-13 23:02:53,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:02:53,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108974952] [2022-07-13 23:02:53,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:53,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:02:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:02:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:02:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:02:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:02:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:02:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:02:53,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:02:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:02:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:02:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:02:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:02:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:02:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:02:53,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 23:02:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:53,556 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-13 23:02:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:02:53,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108974952] [2022-07-13 23:02:53,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108974952] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:02:53,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967655420] [2022-07-13 23:02:53,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:02:53,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:02:53,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:02:53,559 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:02:53,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 23:02:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:02:54,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 1961 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 23:02:54,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:02:54,204 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-13 23:02:54,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:02:54,493 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-13 23:02:54,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967655420] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:02:54,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:02:54,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 11] total 22 [2022-07-13 23:02:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304560263] [2022-07-13 23:02:54,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:02:54,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-13 23:02:54,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:02:54,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-13 23:02:54,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2022-07-13 23:02:54,495 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-13 23:03:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:00,106 INFO L93 Difference]: Finished difference Result 2837 states and 3755 transitions. [2022-07-13 23:03:00,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-13 23:03:00,106 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-13 23:03:00,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:00,128 INFO L225 Difference]: With dead ends: 2837 [2022-07-13 23:03:00,128 INFO L226 Difference]: Without dead ends: 1782 [2022-07-13 23:03:00,131 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-13 23:03:00,132 INFO L413 NwaCegarLoop]: 964 mSDtfsCounter, 2605 mSDsluCounter, 4877 mSDsCounter, 0 mSdLazyCounter, 5661 mSolverCounterSat, 1381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:00,132 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.2s Time] [2022-07-13 23:03:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2022-07-13 23:03:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2022-07-13 23:03:00,211 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-13 23:03:00,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2287 transitions. [2022-07-13 23:03:00,215 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2287 transitions. Word has length 158 [2022-07-13 23:03:00,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:00,235 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2287 transitions. [2022-07-13 23:03:00,235 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-13 23:03:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2287 transitions. [2022-07-13 23:03:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-13 23:03:00,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:00,237 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-13 23:03:00,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:00,438 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-13 23:03:00,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:00,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2103165584, now seen corresponding path program 1 times [2022-07-13 23:03:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:00,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585714063] [2022-07-13 23:03:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-13 23:03:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-07-13 23:03:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:00,653 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-13 23:03:00,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:00,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585714063] [2022-07-13 23:03:00,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585714063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:00,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191399855] [2022-07-13 23:03:00,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:00,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:00,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:00,655 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:03:00,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 23:03:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:01,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 23:03:01,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:01,269 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-13 23:03:01,271 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-13 23:03:01,284 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-13 23:03:01,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:01,468 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-13 23:03:01,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191399855] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:01,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:03:01,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-13 23:03:01,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721961243] [2022-07-13 23:03:01,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:01,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:03:01,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:01,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:03:01,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:03:01,471 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-13 23:03:02,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:02,479 INFO L93 Difference]: Finished difference Result 1822 states and 2390 transitions. [2022-07-13 23:03:02,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:03:02,479 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-13 23:03:02,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:02,485 INFO L225 Difference]: With dead ends: 1822 [2022-07-13 23:03:02,486 INFO L226 Difference]: Without dead ends: 1735 [2022-07-13 23:03:02,487 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-13 23:03:02,487 INFO L413 NwaCegarLoop]: 701 mSDtfsCounter, 6 mSDsluCounter, 3230 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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-13 23:03:02,487 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-13 23:03:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-13 23:03:02,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-13 23:03:02,530 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-13 23:03:02,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2286 transitions. [2022-07-13 23:03:02,534 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2286 transitions. Word has length 168 [2022-07-13 23:03:02,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:02,535 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2286 transitions. [2022-07-13 23:03:02,535 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-13 23:03:02,535 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2286 transitions. [2022-07-13 23:03:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-13 23:03:02,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:02,537 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-13 23:03:02,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:02,754 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-13 23:03:02,754 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:02,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash -332857001, now seen corresponding path program 1 times [2022-07-13 23:03:02,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:02,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380394490] [2022-07-13 23:03:02,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:02,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:02,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:02,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:03:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,027 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-13 23:03:03,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:03,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380394490] [2022-07-13 23:03:03,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380394490] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:03,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700814764] [2022-07-13 23:03:03,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:03,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:03,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:03,029 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 23:03:03,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 23:03:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:03,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-13 23:03:03,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:03,544 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-13 23:03:03,563 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-13 23:03:03,705 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 23:03:03,707 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-13 23:03:03,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:03:03,714 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-13 23:03:04,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:03:04,036 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-13 23:03:04,039 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-13 23:03:04,040 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-13 23:03:04,079 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-13 23:03:04,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:04,206 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-13 23:03:04,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700814764] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:03:04,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:03:04,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 17 [2022-07-13 23:03:04,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434672482] [2022-07-13 23:03:04,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:03:04,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-13 23:03:04,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:04,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-13 23:03:04,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-07-13 23:03:04,209 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-13 23:03:06,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:06,482 INFO L93 Difference]: Finished difference Result 3174 states and 4193 transitions. [2022-07-13 23:03:06,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 23:03:06,483 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-13 23:03:06,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:06,489 INFO L225 Difference]: With dead ends: 3174 [2022-07-13 23:03:06,489 INFO L226 Difference]: Without dead ends: 1735 [2022-07-13 23:03:06,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 365 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-13 23:03:06,493 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 177 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.1s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:06,493 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.1s Time] [2022-07-13 23:03:06,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-07-13 23:03:06,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1735. [2022-07-13 23:03:06,535 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-13 23:03:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2285 transitions. [2022-07-13 23:03:06,539 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2285 transitions. Word has length 169 [2022-07-13 23:03:06,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:06,540 INFO L495 AbstractCegarLoop]: Abstraction has 1735 states and 2285 transitions. [2022-07-13 23:03:06,540 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-13 23:03:06,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2285 transitions. [2022-07-13 23:03:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-13 23:03:06,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:06,542 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-13 23:03:06,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-13 23:03:06,759 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-13 23:03:06,759 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:06,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:06,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1756471977, now seen corresponding path program 1 times [2022-07-13 23:03:06,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:06,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476509359] [2022-07-13 23:03:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:06,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:06,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:06,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:06,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:03:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:07,010 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-13 23:03:07,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:07,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476509359] [2022-07-13 23:03:07,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476509359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:07,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:07,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-13 23:03:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52891363] [2022-07-13 23:03:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:07,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 23:03:07,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:07,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 23:03:07,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-13 23:03:07,013 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-13 23:03:10,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:10,913 INFO L93 Difference]: Finished difference Result 1826 states and 2397 transitions. [2022-07-13 23:03:10,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-13 23:03:10,914 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-13 23:03:10,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:10,921 INFO L225 Difference]: With dead ends: 1826 [2022-07-13 23:03:10,921 INFO L226 Difference]: Without dead ends: 1748 [2022-07-13 23:03:10,922 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-13 23:03:10,922 INFO L413 NwaCegarLoop]: 690 mSDtfsCounter, 502 mSDsluCounter, 4211 mSDsCounter, 0 mSdLazyCounter, 3160 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s 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, 3.8s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:10,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 4901 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 3160 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-13 23:03:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2022-07-13 23:03:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1740. [2022-07-13 23:03:10,964 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-13 23:03:10,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2290 transitions. [2022-07-13 23:03:10,968 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2290 transitions. Word has length 169 [2022-07-13 23:03:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:10,969 INFO L495 AbstractCegarLoop]: Abstraction has 1740 states and 2290 transitions. [2022-07-13 23:03:10,970 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-13 23:03:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2290 transitions. [2022-07-13 23:03:10,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-13 23:03:10,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:10,972 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-13 23:03:10,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-13 23:03:10,972 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:10,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:10,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1061543817, now seen corresponding path program 2 times [2022-07-13 23:03:10,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:10,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854067185] [2022-07-13 23:03:10,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:10,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:03:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:11,256 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-13 23:03:11,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854067185] [2022-07-13 23:03:11,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854067185] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785484559] [2022-07-13 23:03:11,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 23:03:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:11,272 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-13 23:03:11,287 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-13 23:03:11,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 23:03:11,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 23:03:11,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 1980 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 23:03:11,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:11,986 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-13 23:03:11,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:12,316 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-13 23:03:12,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785484559] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:03:12,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 23:03:12,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 15] total 24 [2022-07-13 23:03:12,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479991127] [2022-07-13 23:03:12,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 23:03:12,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-13 23:03:12,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:12,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-13 23:03:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2022-07-13 23:03:12,317 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-13 23:03:17,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:17,544 INFO L93 Difference]: Finished difference Result 2197 states and 2842 transitions. [2022-07-13 23:03:17,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 23:03:17,544 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-13 23:03:17,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:17,554 INFO L225 Difference]: With dead ends: 2197 [2022-07-13 23:03:17,554 INFO L226 Difference]: Without dead ends: 2185 [2022-07-13 23:03:17,556 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-13 23:03:17,557 INFO L413 NwaCegarLoop]: 990 mSDtfsCounter, 6428 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 4921 mSolverCounterSat, 2976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:17,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6706 Valid, 4531 Invalid, 7897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2976 Valid, 4921 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-13 23:03:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-07-13 23:03:17,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2105. [2022-07-13 23:03:17,663 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-13 23:03:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2105 states to 2105 states and 2753 transitions. [2022-07-13 23:03:17,668 INFO L78 Accepts]: Start accepts. Automaton has 2105 states and 2753 transitions. Word has length 169 [2022-07-13 23:03:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:17,668 INFO L495 AbstractCegarLoop]: Abstraction has 2105 states and 2753 transitions. [2022-07-13 23:03:17,668 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-13 23:03:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2105 states and 2753 transitions. [2022-07-13 23:03:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-13 23:03:17,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:17,671 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-13 23:03:17,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 23:03:17,890 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-13 23:03:17,890 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:17,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:17,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1170991758, now seen corresponding path program 1 times [2022-07-13 23:03:17,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:17,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419254255] [2022-07-13 23:03:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:18,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-13 23:03:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-13 23:03:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,137 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-13 23:03:18,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:18,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419254255] [2022-07-13 23:03:18,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419254255] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:18,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336101520] [2022-07-13 23:03:18,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:18,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:18,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:18,139 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-13 23:03:18,140 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-13 23:03:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:18,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 23:03:18,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:18,879 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-13 23:03:18,881 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-13 23:03:18,891 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-13 23:03:18,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:03:18,995 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-13 23:03:18,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336101520] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:18,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:03:18,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2022-07-13 23:03:18,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102414612] [2022-07-13 23:03:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:18,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:03:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:18,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:03:18,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-13 23:03:18,997 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-13 23:03:19,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:19,907 INFO L93 Difference]: Finished difference Result 2171 states and 2812 transitions. [2022-07-13 23:03:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:03:19,908 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-13 23:03:19,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:19,915 INFO L225 Difference]: With dead ends: 2171 [2022-07-13 23:03:19,915 INFO L226 Difference]: Without dead ends: 2076 [2022-07-13 23:03:19,916 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-13 23:03:19,916 INFO L413 NwaCegarLoop]: 688 mSDtfsCounter, 7 mSDsluCounter, 3170 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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-13 23:03:19,916 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-13 23:03:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2022-07-13 23:03:19,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2071. [2022-07-13 23:03:19,962 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-13 23:03:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 2694 transitions. [2022-07-13 23:03:19,965 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 2694 transitions. Word has length 179 [2022-07-13 23:03:19,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:19,966 INFO L495 AbstractCegarLoop]: Abstraction has 2071 states and 2694 transitions. [2022-07-13 23:03:19,966 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-13 23:03:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 2694 transitions. [2022-07-13 23:03:19,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-13 23:03:19,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:19,969 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-13 23:03:20,003 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-13 23:03:20,203 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-13 23:03:20,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:20,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1646245098, now seen corresponding path program 1 times [2022-07-13 23:03:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:20,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559650429] [2022-07-13 23:03:20,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:20,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:20,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 23:03:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:03:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 23:03:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 23:03:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 23:03:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:03:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 23:03:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-13 23:03:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-13 23:03:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-13 23:03:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-13 23:03:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:20,535 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-13 23:03:20,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:20,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559650429] [2022-07-13 23:03:20,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559650429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:20,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:20,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 23:03:20,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031262708] [2022-07-13 23:03:20,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:20,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 23:03:20,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:20,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 23:03:20,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:03:20,537 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-13 23:03:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:23,569 INFO L93 Difference]: Finished difference Result 3867 states and 5086 transitions. [2022-07-13 23:03:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 23:03:23,569 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-13 23:03:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:23,577 INFO L225 Difference]: With dead ends: 3867 [2022-07-13 23:03:23,577 INFO L226 Difference]: Without dead ends: 2110 [2022-07-13 23:03:23,582 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-13 23:03:23,582 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 465 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 2091 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:23,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 3115 Invalid, 2505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2091 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-13 23:03:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2022-07-13 23:03:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 2064. [2022-07-13 23:03:23,637 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-13 23:03:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2686 transitions. [2022-07-13 23:03:23,641 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2686 transitions. Word has length 263 [2022-07-13 23:03:23,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:23,642 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2686 transitions. [2022-07-13 23:03:23,642 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-13 23:03:23,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2686 transitions. [2022-07-13 23:03:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-07-13 23:03:23,645 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:23,645 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-13 23:03:23,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 23:03:23,645 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:23,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1841616438, now seen corresponding path program 1 times [2022-07-13 23:03:23,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:23,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123579181] [2022-07-13 23:03:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:23,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:23,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 23:03:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:03:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 23:03:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 23:03:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 23:03:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:03:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:23,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 23:03:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-13 23:03:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-13 23:03:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-13 23:03:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-07-13 23:03:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:23,943 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-13 23:03:23,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:23,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123579181] [2022-07-13 23:03:23,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123579181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:23,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:03:23,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 23:03:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411307009] [2022-07-13 23:03:23,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:23,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 23:03:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 23:03:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 23:03:23,946 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-13 23:03:26,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:26,086 INFO L93 Difference]: Finished difference Result 2130 states and 2809 transitions. [2022-07-13 23:03:26,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 23:03:26,086 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-13 23:03:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:26,096 INFO L225 Difference]: With dead ends: 2130 [2022-07-13 23:03:26,097 INFO L226 Difference]: Without dead ends: 2120 [2022-07-13 23:03:26,097 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-13 23:03:26,098 INFO L413 NwaCegarLoop]: 833 mSDtfsCounter, 1346 mSDsluCounter, 1545 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 731 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:03:26,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 2378 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [731 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 23:03:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2022-07-13 23:03:26,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 2064. [2022-07-13 23:03:26,157 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-13 23:03:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2685 transitions. [2022-07-13 23:03:26,161 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2685 transitions. Word has length 263 [2022-07-13 23:03:26,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:26,162 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2685 transitions. [2022-07-13 23:03:26,162 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-13 23:03:26,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2685 transitions. [2022-07-13 23:03:26,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2022-07-13 23:03:26,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:26,164 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-13 23:03:26,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 23:03:26,164 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:26,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash 810198159, now seen corresponding path program 1 times [2022-07-13 23:03:26,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:26,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900513147] [2022-07-13 23:03:26,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:26,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:26,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 23:03:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:03:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 23:03:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 23:03:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 23:03:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:03:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 23:03:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-13 23:03:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-13 23:03:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-13 23:03:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-07-13 23:03:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:26,522 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-13 23:03:26,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:26,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900513147] [2022-07-13 23:03:26,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900513147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:26,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446164729] [2022-07-13 23:03:26,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:26,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:26,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:26,540 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-13 23:03:26,566 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-13 23:03:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:27,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 3081 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:03:27,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:27,427 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-13 23:03:27,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:27,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446164729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:27,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:27,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-07-13 23:03:27,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750100494] [2022-07-13 23:03:27,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:27,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:03:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:27,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:03:27,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-13 23:03:27,430 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-13 23:03:27,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:27,677 INFO L93 Difference]: Finished difference Result 3806 states and 4963 transitions. [2022-07-13 23:03:27,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 23:03:27,678 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-13 23:03:27,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:27,684 INFO L225 Difference]: With dead ends: 3806 [2022-07-13 23:03:27,684 INFO L226 Difference]: Without dead ends: 2068 [2022-07-13 23:03:27,688 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-13 23:03:27,689 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-13 23:03:27,689 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-13 23:03:27,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2022-07-13 23:03:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 2064. [2022-07-13 23:03:27,746 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-13 23:03:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2683 transitions. [2022-07-13 23:03:27,751 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2683 transitions. Word has length 268 [2022-07-13 23:03:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:27,751 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2683 transitions. [2022-07-13 23:03:27,752 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-13 23:03:27,752 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2683 transitions. [2022-07-13 23:03:27,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-13 23:03:27,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:27,754 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-13 23:03:27,777 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-13 23:03:27,977 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-13 23:03:27,978 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash 589418021, now seen corresponding path program 1 times [2022-07-13 23:03:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:27,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833195751] [2022-07-13 23:03:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 23:03:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 23:03:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 23:03:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-13 23:03:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 23:03:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 23:03:28,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 23:03:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 23:03:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 23:03:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 23:03:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 23:03:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-13 23:03:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 23:03:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-13 23:03:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-13 23:03:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-13 23:03:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-13 23:03:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-13 23:03:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-13 23:03:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-13 23:03:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-13 23:03:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 23:03:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-13 23:03:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-13 23:03:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-13 23:03:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-07-13 23:03:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2022-07-13 23:03:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-13 23:03:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:28,320 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-13 23:03:28,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 23:03:28,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833195751] [2022-07-13 23:03:28,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833195751] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 23:03:28,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074874263] [2022-07-13 23:03:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:28,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 23:03:28,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:28,336 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-13 23:03:28,337 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-13 23:03:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:03:29,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 23:03:29,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:03:29,268 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-13 23:03:29,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:03:29,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074874263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:03:29,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 23:03:29,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-07-13 23:03:29,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621121842] [2022-07-13 23:03:29,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:03:29,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:03:29,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 23:03:29,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:03:29,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 23:03:29,270 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-13 23:03:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:03:29,398 INFO L93 Difference]: Finished difference Result 3810 states and 4981 transitions. [2022-07-13 23:03:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:03:29,399 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-13 23:03:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:03:29,405 INFO L225 Difference]: With dead ends: 3810 [2022-07-13 23:03:29,405 INFO L226 Difference]: Without dead ends: 2072 [2022-07-13 23:03:29,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-13 23:03:29,410 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-13 23:03:29,410 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-13 23:03:29,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2022-07-13 23:03:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2022-07-13 23:03:29,470 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-13 23:03:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 2691 transitions. [2022-07-13 23:03:29,474 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 2691 transitions. Word has length 288 [2022-07-13 23:03:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:03:29,475 INFO L495 AbstractCegarLoop]: Abstraction has 2072 states and 2691 transitions. [2022-07-13 23:03:29,475 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-13 23:03:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 2691 transitions. [2022-07-13 23:03:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2022-07-13 23:03:29,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:03:29,478 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-13 23:03:29,513 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-13 23:03:29,701 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-13 23:03:29,702 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:03:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:03:29,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1005655303, now seen corresponding path program 1 times [2022-07-13 23:03:29,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 23:03:29,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948129748] [2022-07-13 23:03:29,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:03:29,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 23:03:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 23:03:30,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 23:03:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 23:03:33,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 23:03:33,644 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 23:03:33,645 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 23:03:33,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 23:03:33,650 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-13 23:03:33,655 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 23:03:33,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 11:03:33 BoogieIcfgContainer [2022-07-13 23:03:33,870 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 23:03:33,870 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 23:03:33,870 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 23:03:33,871 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 23:03:33,871 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:02:28" (3/4) ... [2022-07-13 23:03:33,873 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 23:03:33,873 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 23:03:33,874 INFO L158 Benchmark]: Toolchain (without parser) took 68444.99ms. Allocated memory was 109.1MB in the beginning and 950.0MB in the end (delta: 841.0MB). Free memory was 69.3MB in the beginning and 438.7MB in the end (delta: -369.5MB). Peak memory consumption was 472.6MB. Max. memory is 16.1GB. [2022-07-13 23:03:33,874 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 23:03:33,877 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1224.39ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 68.9MB in the beginning and 71.2MB in the end (delta: -2.3MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2022-07-13 23:03:33,877 INFO L158 Benchmark]: Boogie Procedure Inliner took 130.05ms. Allocated memory is still 136.3MB. Free memory was 71.2MB in the beginning and 59.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 23:03:33,878 INFO L158 Benchmark]: Boogie Preprocessor took 153.07ms. Allocated memory is still 136.3MB. Free memory was 59.6MB in the beginning and 48.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 23:03:33,878 INFO L158 Benchmark]: RCFGBuilder took 1654.83ms. Allocated memory was 136.3MB in the beginning and 201.3MB in the end (delta: 65.0MB). Free memory was 48.1MB in the beginning and 126.4MB in the end (delta: -78.3MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2022-07-13 23:03:33,878 INFO L158 Benchmark]: TraceAbstraction took 65272.32ms. Allocated memory was 201.3MB in the beginning and 950.0MB in the end (delta: 748.7MB). Free memory was 125.4MB in the beginning and 438.7MB in the end (delta: -313.3MB). Peak memory consumption was 561.2MB. Max. memory is 16.1GB. [2022-07-13 23:03:33,879 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 950.0MB. Free memory is still 438.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 23:03:33,883 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.28ms. Allocated memory is still 83.9MB. Free memory was 38.4MB in the beginning and 38.3MB in the end (delta: 40.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1224.39ms. Allocated memory was 109.1MB in the beginning and 136.3MB in the end (delta: 27.3MB). Free memory was 68.9MB in the beginning and 71.2MB in the end (delta: -2.3MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 130.05ms. Allocated memory is still 136.3MB. Free memory was 71.2MB in the beginning and 59.6MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.07ms. Allocated memory is still 136.3MB. Free memory was 59.6MB in the beginning and 48.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1654.83ms. Allocated memory was 136.3MB in the beginning and 201.3MB in the end (delta: 65.0MB). Free memory was 48.1MB in the beginning and 126.4MB in the end (delta: -78.3MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. * TraceAbstraction took 65272.32ms. Allocated memory was 201.3MB in the beginning and 950.0MB in the end (delta: 748.7MB). Free memory was 125.4MB in the beginning and 438.7MB in the end (delta: -313.3MB). Peak memory consumption was 561.2MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 950.0MB. Free memory is still 438.7MB. 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: 65.0s, OverallIterations: 22, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 40.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17887 SdHoareTripleChecker+Valid, 37.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16786 mSDsluCounter, 70332 SdHoareTripleChecker+Invalid, 33.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1633 IncrementalHoareTripleChecker+Unchecked, 54276 mSDsCounter, 7803 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30832 IncrementalHoareTripleChecker+Invalid, 40268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7803 mSolverCounterUnsat, 16056 mSDtfsCounter, 30832 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.7s 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.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 368 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 8.3s 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-13 23:03:33,924 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-?-f4b24e3 [2022-07-13 23:03:35,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 23:03:35,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 23:03:35,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 23:03:35,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 23:03:35,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 23:03:35,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 23:03:35,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 23:03:35,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 23:03:35,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 23:03:35,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 23:03:35,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 23:03:35,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 23:03:35,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 23:03:35,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 23:03:35,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 23:03:35,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 23:03:35,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 23:03:35,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 23:03:35,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 23:03:35,758 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 23:03:35,758 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 23:03:35,760 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 23:03:35,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 23:03:35,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 23:03:35,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 23:03:35,774 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 23:03:35,774 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 23:03:35,775 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 23:03:35,775 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 23:03:35,776 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 23:03:35,776 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 23:03:35,777 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 23:03:35,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 23:03:35,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 23:03:35,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 23:03:35,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 23:03:35,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 23:03:35,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 23:03:35,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 23:03:35,781 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 23:03:35,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 23:03:35,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-13 23:03:35,810 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 23:03:35,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 23:03:35,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 23:03:35,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 23:03:35,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 23:03:35,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 23:03:35,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 23:03:35,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 23:03:35,813 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 23:03:35,814 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 23:03:35,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 23:03:35,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 23:03:35,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 23:03:35,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 23:03:35,815 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 23:03:35,815 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 23:03:35,815 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 23:03:35,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 23:03:35,815 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 23:03:35,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 23:03:35,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 23:03:35,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 23:03:35,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 23:03:35,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:03:35,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 23:03:35,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 23:03:35,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 23:03:35,817 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 23:03:35,817 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 23:03:35,817 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 23:03:35,818 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 23:03:35,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 23:03:35,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 23:03:35,818 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-13 23:03:36,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 23:03:36,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 23:03:36,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 23:03:36,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 23:03:36,091 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 23:03:36,092 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-13 23:03:36,130 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d510141/d49d110d15fd4b1f82a257c04b47aac0/FLAGc2ab7684f [2022-07-13 23:03:36,639 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 23:03:36,640 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-13 23:03:36,671 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d510141/d49d110d15fd4b1f82a257c04b47aac0/FLAGc2ab7684f [2022-07-13 23:03:37,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7d510141/d49d110d15fd4b1f82a257c04b47aac0 [2022-07-13 23:03:37,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 23:03:37,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 23:03:37,167 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 23:03:37,167 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 23:03:37,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 23:03:37,169 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:03:37" (1/1) ... [2022-07-13 23:03:37,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d98a837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:37, skipping insertion in model container [2022-07-13 23:03:37,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 11:03:37" (1/1) ... [2022-07-13 23:03:37,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 23:03:37,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:03:38,078 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-13 23:03:38,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:03:38,188 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 23:03:38,238 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 23:03:38,383 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-13 23:03:38,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:03:38,408 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 23:03:38,567 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-13 23:03:38,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 23:03:38,812 INFO L208 MainTranslator]: Completed translation [2022-07-13 23:03:38,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38 WrapperNode [2022-07-13 23:03:38,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 23:03:38,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 23:03:38,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 23:03:38,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 23:03:38,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:38,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:38,944 INFO L137 Inliner]: procedures = 157, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1605 [2022-07-13 23:03:38,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 23:03:38,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 23:03:38,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 23:03:38,946 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 23:03:38,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:38,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:38,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:38,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:39,032 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:39,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:39,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:39,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 23:03:39,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 23:03:39,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 23:03:39,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 23:03:39,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (1/1) ... [2022-07-13 23:03:39,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 23:03:39,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 23:03:39,128 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 23:03:39,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 23:03:39,214 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2022-07-13 23:03:39,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2022-07-13 23:03:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2022-07-13 23:03:39,217 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2022-07-13 23:03:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 23:03:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-13 23:03:39,217 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-13 23:03:39,217 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-13 23:03:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 23:03:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-13 23:03:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-13 23:03:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-13 23:03:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2022-07-13 23:03:39,218 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2022-07-13 23:03:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-07-13 23:03:39,218 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-07-13 23:03:39,218 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2022-07-13 23:03:39,219 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2022-07-13 23:03:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2022-07-13 23:03:39,219 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2022-07-13 23:03:39,219 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2022-07-13 23:03:39,220 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2022-07-13 23:03:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-13 23:03:39,220 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-13 23:03:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-13 23:03:39,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-13 23:03:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-13 23:03:39,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-13 23:03:39,220 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2022-07-13 23:03:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2022-07-13 23:03:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-13 23:03:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-13 23:03:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2022-07-13 23:03:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2022-07-13 23:03:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-07-13 23:03:39,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-07-13 23:03:39,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-13 23:03:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-13 23:03:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-13 23:03:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-13 23:03:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2022-07-13 23:03:39,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2022-07-13 23:03:39,222 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-07-13 23:03:39,222 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-07-13 23:03:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 23:03:39,223 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 23:03:39,223 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2022-07-13 23:03:39,223 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2022-07-13 23:03:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 23:03:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2022-07-13 23:03:39,224 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2022-07-13 23:03:39,224 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2022-07-13 23:03:39,225 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2022-07-13 23:03:39,225 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2022-07-13 23:03:39,226 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2022-07-13 23:03:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 23:03:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 23:03:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 23:03:39,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-13 23:03:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-13 23:03:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-13 23:03:39,227 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2022-07-13 23:03:39,227 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2022-07-13 23:03:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 23:03:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2022-07-13 23:03:39,228 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2022-07-13 23:03:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2022-07-13 23:03:39,228 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2022-07-13 23:03:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-13 23:03:39,228 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-13 23:03:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2022-07-13 23:03:39,228 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2022-07-13 23:03:39,228 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2022-07-13 23:03:39,229 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2022-07-13 23:03:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-13 23:03:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-13 23:03:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-13 23:03:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-07-13 23:03:39,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-07-13 23:03:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 23:03:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 23:03:39,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 23:03:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-13 23:03:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 23:03:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-13 23:03:39,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-13 23:03:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-07-13 23:03:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-07-13 23:03:39,231 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2022-07-13 23:03:39,231 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2022-07-13 23:03:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2022-07-13 23:03:39,232 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2022-07-13 23:03:39,232 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-13 23:03:39,232 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-13 23:03:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-07-13 23:03:39,233 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-07-13 23:03:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-07-13 23:03:39,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-07-13 23:03:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-13 23:03:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2022-07-13 23:03:39,233 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2022-07-13 23:03:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-07-13 23:03:39,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 23:03:39,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 23:03:39,518 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 23:03:39,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 23:03:51,279 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-07-13 23:03:51,407 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:03:51,419 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 23:04:02,953 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2022-07-13 23:04:02,953 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2022-07-13 23:04:02,953 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-07-13 23:04:02,953 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-07-13 23:04:02,971 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 23:04:02,986 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 23:04:02,987 INFO L299 CfgBuilder]: Removed 30 assume(true) statements. [2022-07-13 23:04:02,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:04:02 BoogieIcfgContainer [2022-07-13 23:04:02,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 23:04:02,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 23:04:02,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 23:04:02,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 23:04:02,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 11:03:37" (1/3) ... [2022-07-13 23:04:02,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddf992e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:04:02, skipping insertion in model container [2022-07-13 23:04:02,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 11:03:38" (2/3) ... [2022-07-13 23:04:02,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ddf992e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 11:04:02, skipping insertion in model container [2022-07-13 23:04:03,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 11:04:02" (3/3) ... [2022-07-13 23:04:03,001 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2022-07-13 23:04:03,011 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 23:04:03,011 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 23:04:03,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 23:04:03,087 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@4e85e80c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34dcb9fc [2022-07-13 23:04:03,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 23:04:03,094 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-13 23:04:03,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 23:04:03,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:03,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:03,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:03,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2022-07-13 23:04:03,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:03,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557288147] [2022-07-13 23:04:03,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:03,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:03,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:03,137 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-13 23:04:03,140 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-13 23:04:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:03,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 23:04:03,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:04:03,767 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:03,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:03,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557288147] [2022-07-13 23:04:03,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557288147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:03,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:03,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:04:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285560428] [2022-07-13 23:04:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:03,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:04:03,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:03,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:04:03,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:04:03,800 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-13 23:04:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:03,990 INFO L93 Difference]: Finished difference Result 1076 states and 1560 transitions. [2022-07-13 23:04:03,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 23:04:03,993 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-13 23:04:03,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:04,009 INFO L225 Difference]: With dead ends: 1076 [2022-07-13 23:04:04,009 INFO L226 Difference]: Without dead ends: 540 [2022-07-13 23:04:04,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 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-13 23:04:04,020 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 301 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:04,023 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.0s Time] [2022-07-13 23:04:04,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-07-13 23:04:04,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2022-07-13 23:04:04,096 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-13 23:04:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 700 transitions. [2022-07-13 23:04:04,103 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 700 transitions. Word has length 17 [2022-07-13 23:04:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:04,103 INFO L495 AbstractCegarLoop]: Abstraction has 535 states and 700 transitions. [2022-07-13 23:04:04,103 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-13 23:04:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 700 transitions. [2022-07-13 23:04:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 23:04:04,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:04,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 23:04:04,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 23:04:04,314 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-13 23:04:04,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:04,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1736454649, now seen corresponding path program 1 times [2022-07-13 23:04:04,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:04,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022471656] [2022-07-13 23:04:04,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:04,315 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:04,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:04,346 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-13 23:04:04,365 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-13 23:04:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:04,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:04:04,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:04:04,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:04,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:04,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022471656] [2022-07-13 23:04:04,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022471656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:04,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:04,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 23:04:04,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281635372] [2022-07-13 23:04:04,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:04,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:04:04,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:04,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:04:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:04:04,864 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-13 23:04:04,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:04,950 INFO L93 Difference]: Finished difference Result 1565 states and 2072 transitions. [2022-07-13 23:04:04,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:04:04,950 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-13 23:04:04,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:04,959 INFO L225 Difference]: With dead ends: 1565 [2022-07-13 23:04:04,959 INFO L226 Difference]: Without dead ends: 1048 [2022-07-13 23:04:04,961 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-13 23:04:04,962 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-13 23:04:04,963 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-13 23:04:04,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2022-07-13 23:04:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1045. [2022-07-13 23:04:05,024 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-13 23:04:05,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1376 transitions. [2022-07-13 23:04:05,032 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1376 transitions. Word has length 17 [2022-07-13 23:04:05,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:05,033 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1376 transitions. [2022-07-13 23:04:05,033 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-13 23:04:05,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1376 transitions. [2022-07-13 23:04:05,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 23:04:05,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:05,034 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-13 23:04:05,050 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-13 23:04:05,249 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-13 23:04:05,250 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:05,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:05,250 INFO L85 PathProgramCache]: Analyzing trace with hash 2004221234, now seen corresponding path program 1 times [2022-07-13 23:04:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:05,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121120561] [2022-07-13 23:04:05,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:05,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:05,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:05,254 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-13 23:04:05,256 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-13 23:04:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:05,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:04:05,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:04:05,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:05,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:05,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121120561] [2022-07-13 23:04:05,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121120561] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:05,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:05,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 23:04:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333583249] [2022-07-13 23:04:05,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:05,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:04:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:04:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:04:05,748 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-13 23:04:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:05,766 INFO L93 Difference]: Finished difference Result 1047 states and 1377 transitions. [2022-07-13 23:04:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:04:05,766 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-13 23:04:05,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:05,769 INFO L225 Difference]: With dead ends: 1047 [2022-07-13 23:04:05,769 INFO L226 Difference]: Without dead ends: 1036 [2022-07-13 23:04:05,770 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-13 23:04:05,771 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-13 23:04:05,771 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-13 23:04:05,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-07-13 23:04:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1031. [2022-07-13 23:04:05,818 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-13 23:04:05,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2022-07-13 23:04:05,822 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2022-07-13 23:04:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:05,823 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2022-07-13 23:04:05,823 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-13 23:04:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2022-07-13 23:04:05,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-13 23:04:05,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:05,825 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-13 23:04:05,842 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-13 23:04:06,041 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-13 23:04:06,042 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:06,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:06,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2022-07-13 23:04:06,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:06,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1925891281] [2022-07-13 23:04:06,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:06,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:06,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:06,056 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-13 23:04:06,057 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-13 23:04:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:06,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 23:04:06,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:06,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 23:04:06,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:06,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:06,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1925891281] [2022-07-13 23:04:06,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1925891281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:06,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:06,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 23:04:06,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239693533] [2022-07-13 23:04:06,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:06,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 23:04:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:06,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 23:04:06,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 23:04:06,550 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-13 23:04:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:06,611 INFO L93 Difference]: Finished difference Result 2353 states and 3158 transitions. [2022-07-13 23:04:06,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 23:04:06,611 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-13 23:04:06,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:06,616 INFO L225 Difference]: With dead ends: 2353 [2022-07-13 23:04:06,616 INFO L226 Difference]: Without dead ends: 1334 [2022-07-13 23:04:06,618 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-13 23:04:06,619 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-13 23:04:06,619 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-13 23:04:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2022-07-13 23:04:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1330. [2022-07-13 23:04:06,648 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-13 23:04:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2022-07-13 23:04:06,653 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2022-07-13 23:04:06,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:06,654 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2022-07-13 23:04:06,654 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-13 23:04:06,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2022-07-13 23:04:06,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-13 23:04:06,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:06,657 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-13 23:04:06,675 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-13 23:04:06,872 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-13 23:04:06,873 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:06,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:06,873 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2022-07-13 23:04:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:06,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393576121] [2022-07-13 23:04:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:06,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:06,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:06,884 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-13 23:04:06,886 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-13 23:04:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:07,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:04:07,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:07,406 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-13 23:04:07,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:07,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:07,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393576121] [2022-07-13 23:04:07,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [393576121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:07,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:07,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:04:07,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618976229] [2022-07-13 23:04:07,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:07,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:04:07,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:07,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:04:07,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:04:07,409 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-13 23:04:07,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:07,576 INFO L93 Difference]: Finished difference Result 2669 states and 3616 transitions. [2022-07-13 23:04:07,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:04:07,577 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-13 23:04:07,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:07,582 INFO L225 Difference]: With dead ends: 2669 [2022-07-13 23:04:07,582 INFO L226 Difference]: Without dead ends: 1343 [2022-07-13 23:04:07,585 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-13 23:04:07,585 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-13 23:04:07,586 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-13 23:04:07,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-07-13 23:04:07,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1333. [2022-07-13 23:04:07,613 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-13 23:04:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2022-07-13 23:04:07,618 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 72 [2022-07-13 23:04:07,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:07,618 INFO L495 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2022-07-13 23:04:07,618 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-13 23:04:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2022-07-13 23:04:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-13 23:04:07,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:07,620 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-13 23:04:07,638 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-13 23:04:07,835 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-13 23:04:07,836 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash -84772232, now seen corresponding path program 1 times [2022-07-13 23:04:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:07,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [920012384] [2022-07-13 23:04:07,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:07,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:07,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:07,838 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-13 23:04:07,839 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-13 23:04:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:08,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 23:04:08,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:08,471 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-13 23:04:08,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:08,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:08,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [920012384] [2022-07-13 23:04:08,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [920012384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:08,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:08,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 23:04:08,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470762477] [2022-07-13 23:04:08,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:08,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 23:04:08,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:08,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 23:04:08,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 23:04:08,472 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-13 23:04:08,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:08,693 INFO L93 Difference]: Finished difference Result 2675 states and 3616 transitions. [2022-07-13 23:04:08,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 23:04:08,694 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-13 23:04:08,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:08,700 INFO L225 Difference]: With dead ends: 2675 [2022-07-13 23:04:08,700 INFO L226 Difference]: Without dead ends: 1346 [2022-07-13 23:04:08,704 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-13 23:04:08,705 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.2s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:08,706 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.2s Time] [2022-07-13 23:04:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2022-07-13 23:04:08,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1330. [2022-07-13 23:04:08,740 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-13 23:04:08,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2022-07-13 23:04:08,746 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 80 [2022-07-13 23:04:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:08,747 INFO L495 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2022-07-13 23:04:08,747 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-13 23:04:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2022-07-13 23:04:08,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 23:04:08,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:08,754 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-13 23:04:08,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-13 23:04:08,967 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-13 23:04:08,968 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:08,968 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2022-07-13 23:04:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:08,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [578377189] [2022-07-13 23:04:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:08,969 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:08,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:08,972 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-13 23:04:08,974 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-13 23:04:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:09,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 23:04:09,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:09,732 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-13 23:04:09,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:09,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:09,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [578377189] [2022-07-13 23:04:09,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [578377189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:09,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:09,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 23:04:09,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779293916] [2022-07-13 23:04:09,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:09,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 23:04:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:09,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 23:04:09,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 23:04:09,734 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-13 23:04:10,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:10,485 INFO L93 Difference]: Finished difference Result 2671 states and 3615 transitions. [2022-07-13 23:04:10,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:04:10,486 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-13 23:04:10,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:10,491 INFO L225 Difference]: With dead ends: 2671 [2022-07-13 23:04:10,491 INFO L226 Difference]: Without dead ends: 1351 [2022-07-13 23:04:10,494 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-13 23:04:10,494 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.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:10,494 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.7s Time] [2022-07-13 23:04:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-13 23:04:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2022-07-13 23:04:10,518 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-13 23:04:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1808 transitions. [2022-07-13 23:04:10,522 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1808 transitions. Word has length 146 [2022-07-13 23:04:10,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:10,522 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1808 transitions. [2022-07-13 23:04:10,523 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-13 23:04:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1808 transitions. [2022-07-13 23:04:10,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-13 23:04:10,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:10,524 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-13 23:04:10,568 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-13 23:04:10,743 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-13 23:04:10,744 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:10,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:10,744 INFO L85 PathProgramCache]: Analyzing trace with hash 971530265, now seen corresponding path program 1 times [2022-07-13 23:04:10,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:10,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073813820] [2022-07-13 23:04:10,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:10,746 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:10,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:10,747 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-13 23:04:10,748 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-13 23:04:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:11,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 23:04:11,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:11,614 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-13 23:04:11,622 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-13 23:04:11,712 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-13 23:04:11,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:04:11,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:11,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073813820] [2022-07-13 23:04:11,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073813820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:04:11,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:04:11,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:04:11,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734994737] [2022-07-13 23:04:11,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:04:11,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:04:11,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:11,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:04:11,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:04:11,713 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-13 23:04:13,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:14,638 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:16,686 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-13 23:04:18,706 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-13 23:04:20,754 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-13 23:04:22,763 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-13 23:04:24,818 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-13 23:04:26,831 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-13 23:04:29,063 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-13 23:04:31,080 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-13 23:04:33,164 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:34,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:36,957 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-13 23:04:38,973 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-13 23:04:40,434 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:42,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:44,960 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-13 23:04:46,760 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:48,779 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-13 23:04:50,851 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-13 23:04:51,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:04:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:04:52,571 INFO L93 Difference]: Finished difference Result 1399 states and 1888 transitions. [2022-07-13 23:04:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:04:52,572 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-13 23:04:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:04:52,577 INFO L225 Difference]: With dead ends: 1399 [2022-07-13 23:04:52,577 INFO L226 Difference]: Without dead ends: 1339 [2022-07-13 23:04:52,578 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-13 23:04:52,583 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3863 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.7s IncrementalHoareTripleChecker+Time [2022-07-13 23:04:52,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3863 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 267 Invalid, 13 Unknown, 0 Unchecked, 40.7s Time] [2022-07-13 23:04:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2022-07-13 23:04:52,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2022-07-13 23:04:52,611 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-13 23:04:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2022-07-13 23:04:52,615 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 146 [2022-07-13 23:04:52,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:04:52,615 INFO L495 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2022-07-13 23:04:52,615 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-13 23:04:52,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2022-07-13 23:04:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 23:04:52,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:04:52,617 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-13 23:04:52,657 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-13 23:04:52,843 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-13 23:04:52,844 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:04:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:04:52,844 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2022-07-13 23:04:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:04:52,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487136490] [2022-07-13 23:04:52,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:04:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:04:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:04:52,846 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-13 23:04:52,849 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-13 23:04:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:04:57,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 23:04:57,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:04:57,889 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-13 23:04:57,904 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-13 23:04:58,319 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 23:04:58,320 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-13 23:04:58,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:04:58,337 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-13 23:04:58,673 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-13 23:04:58,674 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-13 23:04:58,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 23:04:58,691 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-13 23:04:59,005 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-13 23:04:59,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-13 23:04:59,049 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-13 23:04:59,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:04:59,266 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-13 23:04:59,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:04:59,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487136490] [2022-07-13 23:04:59,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487136490] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:04:59,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:04:59,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2022-07-13 23:04:59,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539129442] [2022-07-13 23:04:59,266 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:04:59,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:04:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:04:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:04:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:04:59,267 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-13 23:05:01,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:03,174 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-13 23:05:05,216 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-13 23:05:07,263 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-13 23:05:09,457 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-13 23:05:12,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:14,101 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-13 23:05:16,019 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-13 23:05:18,422 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-13 23:05:20,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:21,493 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:21,878 INFO L93 Difference]: Finished difference Result 2386 states and 3197 transitions. [2022-07-13 23:05:21,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 23:05:21,879 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-13 23:05:21,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:21,883 INFO L225 Difference]: With dead ends: 2386 [2022-07-13 23:05:21,883 INFO L226 Difference]: Without dead ends: 1008 [2022-07-13 23:05:21,886 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-13 23:05:21,887 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 2 mSDsluCounter, 3272 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3974 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2022-07-13 23:05:21,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3974 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 6 Unknown, 101 Unchecked, 22.5s Time] [2022-07-13 23:05:21,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2022-07-13 23:05:21,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2022-07-13 23:05:21,905 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-13 23:05:21,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2022-07-13 23:05:21,907 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2022-07-13 23:05:21,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:21,908 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2022-07-13 23:05:21,908 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-13 23:05:21,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2022-07-13 23:05:21,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 23:05:21,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:21,910 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-13 23:05:21,947 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-13 23:05:22,124 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-13 23:05:22,124 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:22,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2022-07-13 23:05:22,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:22,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313664818] [2022-07-13 23:05:22,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 23:05:22,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:22,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:22,126 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-13 23:05:22,128 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-13 23:05:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 23:05:22,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 23:05:22,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:22,944 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-13 23:05:22,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 23:05:22,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:22,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313664818] [2022-07-13 23:05:22,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313664818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 23:05:22,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 23:05:22,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 23:05:22,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257841462] [2022-07-13 23:05:22,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 23:05:22,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 23:05:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:22,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 23:05:22,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 23:05:22,945 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-13 23:05:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 23:05:23,057 INFO L93 Difference]: Finished difference Result 1696 states and 2271 transitions. [2022-07-13 23:05:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 23:05:23,059 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-13 23:05:23,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 23:05:23,079 INFO L225 Difference]: With dead ends: 1696 [2022-07-13 23:05:23,079 INFO L226 Difference]: Without dead ends: 1011 [2022-07-13 23:05:23,081 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-13 23:05:23,082 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-13 23:05:23,082 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-13 23:05:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2022-07-13 23:05:23,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2022-07-13 23:05:23,104 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-13 23:05:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2022-07-13 23:05:23,107 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 147 [2022-07-13 23:05:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 23:05:23,107 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2022-07-13 23:05:23,107 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-13 23:05:23,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2022-07-13 23:05:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-13 23:05:23,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 23:05:23,109 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-13 23:05:23,134 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-13 23:05:23,331 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-13 23:05:23,331 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 23:05:23,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 23:05:23,332 INFO L85 PathProgramCache]: Analyzing trace with hash 345028375, now seen corresponding path program 2 times [2022-07-13 23:05:23,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 23:05:23,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449313183] [2022-07-13 23:05:23,332 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 23:05:23,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 23:05:23,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 23:05:23,334 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-13 23:05:23,335 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-13 23:05:24,983 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 23:05:24,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 23:05:25,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-13 23:05:25,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 23:05:25,561 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-13 23:05:25,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 23:05:26,475 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-13 23:05:26,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 23:05:26,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449313183] [2022-07-13 23:05:26,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [449313183] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 23:05:26,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 23:05:26,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2022-07-13 23:05:26,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581380938] [2022-07-13 23:05:26,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 23:05:26,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 23:05:26,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 23:05:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 23:05:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-13 23:05:26,478 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-13 23:05:28,852 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-13 23:05:30,936 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-13 23:05:33,213 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-13 23:05:35,832 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:37,926 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-13 23:05:39,939 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-13 23:05:41,955 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-13 23:05:44,087 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-13 23:05:45,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:48,007 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-13 23:05:50,186 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-13 23:05:52,105 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-13 23:05:54,124 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-13 23:05:56,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:05:58,316 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 23:06:02,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-13 23:06:04,325 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-13 23:06:06,345 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-13 23:06:08,592 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-13 23:06:10,602 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-13 23:06:12,616 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-13 23:06:15,679 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-13 23:06:17,688 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-13 23:06:19,698 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-13 23:06:21,759 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-13 23:06:23,769 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-13 23:06:25,782 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-13 23:06:28,138 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-13 23:06:30,155 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-13 23:06:32,213 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-13 23:06:34,229 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-13 23:06:36,890 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-13 23:06:38,902 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 []