./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 c3fed411 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-tmp.no-commuhash-c3fed41 [2021-12-18 01:33:13,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 01:33:13,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 01:33:13,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 01:33:13,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 01:33:13,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 01:33:13,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 01:33:13,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 01:33:13,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 01:33:13,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 01:33:13,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 01:33:13,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 01:33:13,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 01:33:13,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 01:33:13,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 01:33:13,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 01:33:13,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 01:33:13,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 01:33:13,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 01:33:13,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 01:33:13,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 01:33:13,988 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 01:33:13,989 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 01:33:13,990 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 01:33:13,992 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 01:33:13,992 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 01:33:13,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 01:33:13,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 01:33:13,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 01:33:13,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 01:33:13,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 01:33:13,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 01:33:13,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 01:33:13,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 01:33:13,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 01:33:13,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 01:33:13,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 01:33:13,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 01:33:13,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 01:33:13,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 01:33:13,999 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 01:33:14,001 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-18 01:33:14,034 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 01:33:14,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 01:33:14,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 01:33:14,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 01:33:14,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 01:33:14,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 01:33:14,041 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 01:33:14,041 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 01:33:14,041 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 01:33:14,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 01:33:14,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 01:33:14,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 01:33:14,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 01:33:14,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 01:33:14,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 01:33:14,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 01:33:14,043 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 01:33:14,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 01:33:14,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 01:33:14,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 01:33:14,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 01:33:14,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:33:14,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 01:33:14,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 01:33:14,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 01:33:14,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 01:33:14,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 01:33:14,046 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 01:33:14,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 01:33:14,047 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 01:33:14,047 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 01:33:14,047 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 [2021-12-18 01:33:14,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 01:33:14,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 01:33:14,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 01:33:14,234 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 01:33:14,235 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 01:33:14,236 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 [2021-12-18 01:33:14,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ed77136/d003818a20ed4fa39ecef89a60a730bb/FLAGa1150463e [2021-12-18 01:33:14,868 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 01:33:14,869 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 [2021-12-18 01:33:14,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ed77136/d003818a20ed4fa39ecef89a60a730bb/FLAGa1150463e [2021-12-18 01:33:15,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88ed77136/d003818a20ed4fa39ecef89a60a730bb [2021-12-18 01:33:15,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 01:33:15,071 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 01:33:15,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 01:33:15,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 01:33:15,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 01:33:15,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:33:15" (1/1) ... [2021-12-18 01:33:15,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6040fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:15, skipping insertion in model container [2021-12-18 01:33:15,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:33:15" (1/1) ... [2021-12-18 01:33:15,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 01:33:15,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 01:33:15,886 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] [2021-12-18 01:33:15,913 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:33:15,942 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 01:33:16,087 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] [2021-12-18 01:33:16,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:33:16,264 INFO L208 MainTranslator]: Completed translation [2021-12-18 01:33:16,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16 WrapperNode [2021-12-18 01:33:16,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 01:33:16,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 01:33:16,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 01:33:16,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 01:33:16,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,380 INFO L137 Inliner]: procedures = 142, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1657 [2021-12-18 01:33:16,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 01:33:16,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 01:33:16,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 01:33:16,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 01:33:16,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 01:33:16,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 01:33:16,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 01:33:16,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 01:33:16,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (1/1) ... [2021-12-18 01:33:16,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:33:16,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:16,517 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) [2021-12-18 01:33:16,526 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 [2021-12-18 01:33:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-12-18 01:33:16,557 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-12-18 01:33:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2021-12-18 01:33:16,557 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2021-12-18 01:33:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-18 01:33:16,557 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2021-12-18 01:33:16,557 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2021-12-18 01:33:16,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 01:33:16,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 01:33:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 01:33:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-12-18 01:33:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-12-18 01:33:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2021-12-18 01:33:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2021-12-18 01:33:16,584 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2021-12-18 01:33:16,584 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2021-12-18 01:33:16,585 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2021-12-18 01:33:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2021-12-18 01:33:16,585 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2021-12-18 01:33:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2021-12-18 01:33:16,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 01:33:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 01:33:16,585 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-18 01:33:16,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-18 01:33:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 01:33:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 01:33:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2021-12-18 01:33:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2021-12-18 01:33:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-12-18 01:33:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-12-18 01:33:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 01:33:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2021-12-18 01:33:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2021-12-18 01:33:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-18 01:33:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-18 01:33:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-12-18 01:33:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-12-18 01:33:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-12-18 01:33:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-12-18 01:33:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-18 01:33:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-18 01:33:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-18 01:33:16,588 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-18 01:33:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 01:33:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2021-12-18 01:33:16,588 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2021-12-18 01:33:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2021-12-18 01:33:16,588 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2021-12-18 01:33:16,588 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-12-18 01:33:16,589 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-12-18 01:33:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 01:33:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 01:33:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 01:33:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2021-12-18 01:33:16,589 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2021-12-18 01:33:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 01:33:16,589 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2021-12-18 01:33:16,589 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2021-12-18 01:33:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2021-12-18 01:33:16,590 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2021-12-18 01:33:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-18 01:33:16,590 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-18 01:33:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2021-12-18 01:33:16,590 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2021-12-18 01:33:16,590 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2021-12-18 01:33:16,591 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2021-12-18 01:33:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-18 01:33:16,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-18 01:33:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 01:33:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 01:33:16,591 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-12-18 01:33:16,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-12-18 01:33:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2021-12-18 01:33:16,592 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2021-12-18 01:33:16,592 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-18 01:33:16,593 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-18 01:33:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-18 01:33:16,593 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-18 01:33:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-18 01:33:16,593 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-18 01:33:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-18 01:33:16,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-18 01:33:16,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 01:33:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2021-12-18 01:33:16,594 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2021-12-18 01:33:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2021-12-18 01:33:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-12-18 01:33:16,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 01:33:16,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 01:33:16,971 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 01:33:16,972 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 01:33:17,379 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-18 01:33:17,444 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:33:17,489 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:33:18,393 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-12-18 01:33:18,393 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-12-18 01:33:18,393 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2021-12-18 01:33:18,393 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2021-12-18 01:33:18,408 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 01:33:18,423 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 01:33:18,424 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-18 01:33:18,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:18 BoogieIcfgContainer [2021-12-18 01:33:18,428 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 01:33:18,430 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 01:33:18,430 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 01:33:18,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 01:33:18,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:33:15" (1/3) ... [2021-12-18 01:33:18,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bd912b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:33:18, skipping insertion in model container [2021-12-18 01:33:18,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:33:16" (2/3) ... [2021-12-18 01:33:18,435 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51bd912b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:33:18, skipping insertion in model container [2021-12-18 01:33:18,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:18" (3/3) ... [2021-12-18 01:33:18,436 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-12-18 01:33:18,441 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 01:33:18,442 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 01:33:18,497 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 01:33:18,504 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 01:33:18,505 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 01:33:18,542 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) [2021-12-18 01:33:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 01:33:18,558 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:18,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:33:18,559 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:18,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2021-12-18 01:33:18,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:18,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670195711] [2021-12-18 01:33:18,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:18,570 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:18,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:18,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670195711] [2021-12-18 01:33:18,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670195711] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:18,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:18,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:33:18,929 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459925953] [2021-12-18 01:33:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:18,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:33:18,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:18,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:33:18,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:33:18,957 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 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) [2021-12-18 01:33:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:19,088 INFO L93 Difference]: Finished difference Result 1577 states and 2310 transitions. [2021-12-18 01:33:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:33:19,092 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 [2021-12-18 01:33:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:19,117 INFO L225 Difference]: With dead ends: 1577 [2021-12-18 01:33:19,117 INFO L226 Difference]: Without dead ends: 1043 [2021-12-18 01:33:19,129 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:19,131 INFO L933 BasicCegarLoop]: 980 mSDtfsCounter, 690 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 1659 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 [2021-12-18 01:33:19,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [690 Valid, 1659 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:33:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2021-12-18 01:33:19,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1040. [2021-12-18 01:33:19,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 734 states have (on average 1.2179836512261581) internal successors, (894), 747 states have internal predecessors, (894), 238 states have call successors, (238), 68 states have call predecessors, (238), 67 states have return successors, (239), 233 states have call predecessors, (239), 235 states have call successors, (239) [2021-12-18 01:33:19,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1371 transitions. [2021-12-18 01:33:19,220 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1371 transitions. Word has length 17 [2021-12-18 01:33:19,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:19,220 INFO L470 AbstractCegarLoop]: Abstraction has 1040 states and 1371 transitions. [2021-12-18 01:33:19,220 INFO L471 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) [2021-12-18 01:33:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1371 transitions. [2021-12-18 01:33:19,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 01:33:19,221 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:19,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:33:19,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 01:33:19,221 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:19,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1303156656, now seen corresponding path program 1 times [2021-12-18 01:33:19,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:19,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861263174] [2021-12-18 01:33:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:19,223 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:19,331 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:19,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861263174] [2021-12-18 01:33:19,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861263174] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:19,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:19,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:33:19,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219589684] [2021-12-18 01:33:19,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:19,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:33:19,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:33:19,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:33:19,334 INFO L87 Difference]: Start difference. First operand 1040 states and 1371 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) [2021-12-18 01:33:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:19,378 INFO L93 Difference]: Finished difference Result 1042 states and 1372 transitions. [2021-12-18 01:33:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:33:19,378 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 [2021-12-18 01:33:19,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:19,387 INFO L225 Difference]: With dead ends: 1042 [2021-12-18 01:33:19,387 INFO L226 Difference]: Without dead ends: 1031 [2021-12-18 01:33:19,390 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:19,392 INFO L933 BasicCegarLoop]: 693 mSDtfsCounter, 685 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 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 [2021-12-18 01:33:19,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:33:19,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2021-12-18 01:33:19,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2021-12-18 01:33:19,434 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) [2021-12-18 01:33:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2021-12-18 01:33:19,439 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2021-12-18 01:33:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:19,439 INFO L470 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2021-12-18 01:33:19,439 INFO L471 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) [2021-12-18 01:33:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2021-12-18 01:33:19,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-18 01:33:19,446 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:19,446 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:19,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 01:33:19,446 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2021-12-18 01:33:19,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:19,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889414981] [2021-12-18 01:33:19,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:19,453 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2021-12-18 01:33:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2021-12-18 01:33:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:19,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:19,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:19,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889414981] [2021-12-18 01:33:19,609 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889414981] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:19,609 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:19,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 01:33:19,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430488612] [2021-12-18 01:33:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:19,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:33:19,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:19,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:33:19,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:33:19,611 INFO L87 Difference]: Start difference. First operand 1031 states and 1356 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) [2021-12-18 01:33:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:20,392 INFO L93 Difference]: Finished difference Result 2371 states and 3192 transitions. [2021-12-18 01:33:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 01:33:20,392 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 [2021-12-18 01:33:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:20,399 INFO L225 Difference]: With dead ends: 2371 [2021-12-18 01:33:20,400 INFO L226 Difference]: Without dead ends: 1352 [2021-12-18 01:33:20,406 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:20,409 INFO L933 BasicCegarLoop]: 775 mSDtfsCounter, 417 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:20,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [527 Valid, 1470 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-18 01:33:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-12-18 01:33:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1330. [2021-12-18 01:33:20,461 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) [2021-12-18 01:33:20,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2021-12-18 01:33:20,471 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2021-12-18 01:33:20,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:20,472 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2021-12-18 01:33:20,472 INFO L471 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) [2021-12-18 01:33:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2021-12-18 01:33:20,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-18 01:33:20,477 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:20,477 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:20,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 01:33:20,478 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:20,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:20,478 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2021-12-18 01:33:20,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:20,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639383977] [2021-12-18 01:33:20,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:20,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:20,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:20,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2021-12-18 01:33:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:20,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:20,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2021-12-18 01:33:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:33:20,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:20,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639383977] [2021-12-18 01:33:20,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639383977] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:20,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:33:20,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 01:33:20,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705356509] [2021-12-18 01:33:20,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:20,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 01:33:20,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:20,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 01:33:20,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 01:33:20,617 INFO L87 Difference]: Start difference. First operand 1330 states and 1804 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) [2021-12-18 01:33:21,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:21,567 INFO L93 Difference]: Finished difference Result 2687 states and 3650 transitions. [2021-12-18 01:33:21,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:33:21,568 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 [2021-12-18 01:33:21,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:21,573 INFO L225 Difference]: With dead ends: 2687 [2021-12-18 01:33:21,574 INFO L226 Difference]: Without dead ends: 1358 [2021-12-18 01:33:21,577 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:21,578 INFO L933 BasicCegarLoop]: 672 mSDtfsCounter, 173 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:21,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 2013 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-18 01:33:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2021-12-18 01:33:21,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1330. [2021-12-18 01:33:21,612 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) [2021-12-18 01:33:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2021-12-18 01:33:21,618 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 72 [2021-12-18 01:33:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:21,618 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2021-12-18 01:33:21,619 INFO L471 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) [2021-12-18 01:33:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2021-12-18 01:33:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-18 01:33:21,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:21,620 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:21,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 01:33:21,621 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:21,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2021-12-18 01:33:21,621 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:21,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314529055] [2021-12-18 01:33:21,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:21,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:33:21,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:33:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:21,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:33:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:21,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:33:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-18 01:33:21,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:21,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314529055] [2021-12-18 01:33:21,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314529055] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:21,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458901958] [2021-12-18 01:33:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:21,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:21,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:21,898 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) [2021-12-18 01:33:21,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 01:33:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:22,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 1884 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 01:33:22,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:22,567 INFO L388 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 [2021-12-18 01:33:22,584 INFO L388 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 [2021-12-18 01:33:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-18 01:33:22,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:33:22,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458901958] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:22,632 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:33:22,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-12-18 01:33:22,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927492365] [2021-12-18 01:33:22,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:22,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:33:22,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:22,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:33:22,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:33:22,635 INFO L87 Difference]: Start difference. First operand 1330 states and 1798 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) [2021-12-18 01:33:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:23,611 INFO L93 Difference]: Finished difference Result 1392 states and 1878 transitions. [2021-12-18 01:33:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:33:23,612 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 [2021-12-18 01:33:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:23,617 INFO L225 Difference]: With dead ends: 1392 [2021-12-18 01:33:23,617 INFO L226 Difference]: Without dead ends: 1332 [2021-12-18 01:33:23,618 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:33:23,619 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:23,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3919 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-18 01:33:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2021-12-18 01:33:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1330. [2021-12-18 01:33:23,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 945 states have (on average 1.2296296296296296) internal successors, (1162), 966 states have internal predecessors, (1162), 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) [2021-12-18 01:33:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1796 transitions. [2021-12-18 01:33:23,668 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1796 transitions. Word has length 146 [2021-12-18 01:33:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:23,668 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1796 transitions. [2021-12-18 01:33:23,668 INFO L471 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) [2021-12-18 01:33:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1796 transitions. [2021-12-18 01:33:23,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-18 01:33:23,670 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:23,670 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:23,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 01:33:23,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:23,890 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:23,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1832854936, now seen corresponding path program 1 times [2021-12-18 01:33:23,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:23,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516065820] [2021-12-18 01:33:23,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:23,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:23,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:33:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:33:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:33:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:33:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,141 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2021-12-18 01:33:24,141 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:24,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516065820] [2021-12-18 01:33:24,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516065820] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:24,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033738845] [2021-12-18 01:33:24,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:24,141 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:24,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:24,142 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) [2021-12-18 01:33:24,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 01:33:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:24,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 01:33:24,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:24,814 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-18 01:33:24,814 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:33:24,815 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033738845] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:24,815 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:33:24,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2021-12-18 01:33:24,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731947967] [2021-12-18 01:33:24,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:24,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:33:24,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:33:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:33:24,816 INFO L87 Difference]: Start difference. First operand 1330 states and 1796 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) [2021-12-18 01:33:24,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:24,925 INFO L93 Difference]: Finished difference Result 2671 states and 3611 transitions. [2021-12-18 01:33:24,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:33:24,926 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 [2021-12-18 01:33:24,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:24,932 INFO L225 Difference]: With dead ends: 2671 [2021-12-18 01:33:24,932 INFO L226 Difference]: Without dead ends: 1351 [2021-12-18 01:33:24,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:33:24,937 INFO L933 BasicCegarLoop]: 703 mSDtfsCounter, 12 mSDsluCounter, 2785 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3488 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:24,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 3488 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:33:24,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-12-18 01:33:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2021-12-18 01:33:24,973 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) [2021-12-18 01:33:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2021-12-18 01:33:24,981 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 147 [2021-12-18 01:33:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:24,981 INFO L470 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2021-12-18 01:33:24,981 INFO L471 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) [2021-12-18 01:33:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2021-12-18 01:33:24,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-18 01:33:24,987 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:24,988 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:25,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-18 01:33:25,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-18 01:33:25,207 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:25,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:25,207 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2021-12-18 01:33:25,207 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:25,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701049670] [2021-12-18 01:33:25,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:25,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:33:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:33:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:33:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:33:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-12-18 01:33:25,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:25,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701049670] [2021-12-18 01:33:25,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701049670] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:25,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252369395] [2021-12-18 01:33:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:25,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:25,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:25,469 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) [2021-12-18 01:33:25,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 01:33:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:25,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 1898 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-18 01:33:25,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:26,065 INFO L388 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 [2021-12-18 01:33:26,069 INFO L388 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 [2021-12-18 01:33:26,223 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:33:26,224 INFO L388 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 [2021-12-18 01:33:26,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:26,229 INFO L388 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 [2021-12-18 01:33:26,390 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:33:26,390 INFO L388 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 [2021-12-18 01:33:26,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:26,395 INFO L388 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 [2021-12-18 01:33:26,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:26,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:26,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:26,720 INFO L388 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 [2021-12-18 01:33:26,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:26,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:26,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:26,734 INFO L388 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 [2021-12-18 01:33:26,772 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-18 01:33:26,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:33:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-12-18 01:33:29,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252369395] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:33:29,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:33:29,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 19 [2021-12-18 01:33:29,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319530272] [2021-12-18 01:33:29,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:33:29,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-12-18 01:33:29,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:29,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-18 01:33:29,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2021-12-18 01:33:29,194 INFO L87 Difference]: Start difference. First operand 1337 states and 1806 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) [2021-12-18 01:33:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:32,378 INFO L93 Difference]: Finished difference Result 2440 states and 3300 transitions. [2021-12-18 01:33:32,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 01:33:32,379 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 [2021-12-18 01:33:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:32,384 INFO L225 Difference]: With dead ends: 2440 [2021-12-18 01:33:32,384 INFO L226 Difference]: Without dead ends: 1024 [2021-12-18 01:33:32,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 315 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2021-12-18 01:33:32,388 INFO L933 BasicCegarLoop]: 693 mSDtfsCounter, 313 mSDsluCounter, 3865 mSDsCounter, 0 mSdLazyCounter, 1345 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 4558 SdHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 1345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:32,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 4558 Invalid, 1954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 1345 Invalid, 0 Unknown, 342 Unchecked, 3.0s Time] [2021-12-18 01:33:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2021-12-18 01:33:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1008. [2021-12-18 01:33:32,416 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) [2021-12-18 01:33:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2021-12-18 01:33:32,420 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2021-12-18 01:33:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:32,421 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2021-12-18 01:33:32,421 INFO L471 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) [2021-12-18 01:33:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2021-12-18 01:33:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-18 01:33:32,423 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:32,423 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:32,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 01:33:32,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:32,639 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:32,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:32,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2021-12-18 01:33:32,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:32,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649142288] [2021-12-18 01:33:32,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:32,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:33:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:33:32,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:32,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:33:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:33:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-12-18 01:33:32,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:32,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649142288] [2021-12-18 01:33:32,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649142288] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:32,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307657165] [2021-12-18 01:33:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:32,997 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:32,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:32,999 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) [2021-12-18 01:33:33,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 01:33:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:33,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 1897 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 01:33:33,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-18 01:33:33,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:33:34,204 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-18 01:33:34,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307657165] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:33:34,205 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:33:34,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2021-12-18 01:33:34,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611957686] [2021-12-18 01:33:34,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:33:34,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 01:33:34,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:34,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 01:33:34,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2021-12-18 01:33:34,207 INFO L87 Difference]: Start difference. First operand 1008 states and 1336 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) [2021-12-18 01:33:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:39,883 INFO L93 Difference]: Finished difference Result 2083 states and 2784 transitions. [2021-12-18 01:33:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-18 01:33:39,884 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 [2021-12-18 01:33:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:39,889 INFO L225 Difference]: With dead ends: 2083 [2021-12-18 01:33:39,889 INFO L226 Difference]: Without dead ends: 1389 [2021-12-18 01:33:39,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=853, Unknown=0, NotChecked=0, Total=1122 [2021-12-18 01:33:39,892 INFO L933 BasicCegarLoop]: 915 mSDtfsCounter, 1391 mSDsluCounter, 5203 mSDsCounter, 0 mSdLazyCounter, 4322 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 6118 SdHoareTripleChecker+Invalid, 4969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 4322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:39,892 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1522 Valid, 6118 Invalid, 4969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 4322 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2021-12-18 01:33:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2021-12-18 01:33:39,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1364. [2021-12-18 01:33:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 967 states have (on average 1.2223371251292658) internal successors, (1182), 989 states have internal predecessors, (1182), 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) [2021-12-18 01:33:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1813 transitions. [2021-12-18 01:33:39,926 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1813 transitions. Word has length 147 [2021-12-18 01:33:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:39,927 INFO L470 AbstractCegarLoop]: Abstraction has 1364 states and 1813 transitions. [2021-12-18 01:33:39,927 INFO L471 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) [2021-12-18 01:33:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1813 transitions. [2021-12-18 01:33:39,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-18 01:33:39,928 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:39,929 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:39,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-18 01:33:40,142 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:40,143 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash -981047690, now seen corresponding path program 1 times [2021-12-18 01:33:40,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:40,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849587500] [2021-12-18 01:33:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:40,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:40,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:33:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:33:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:33:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:33:40,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2021-12-18 01:33:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,415 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-18 01:33:40,415 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849587500] [2021-12-18 01:33:40,415 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849587500] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:40,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456862391] [2021-12-18 01:33:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:40,415 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:40,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:40,416 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) [2021-12-18 01:33:40,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 01:33:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:40,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 1930 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 01:33:40,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:41,128 INFO L388 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 [2021-12-18 01:33:41,130 INFO L388 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 [2021-12-18 01:33:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-18 01:33:41,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:33:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-18 01:33:41,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456862391] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:41,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:33:41,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2021-12-18 01:33:41,390 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842550236] [2021-12-18 01:33:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:41,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:33:41,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:41,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:33:41,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-18 01:33:41,391 INFO L87 Difference]: Start difference. First operand 1364 states and 1813 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) [2021-12-18 01:33:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:42,068 INFO L93 Difference]: Finished difference Result 1429 states and 1891 transitions. [2021-12-18 01:33:42,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:33:42,068 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 [2021-12-18 01:33:42,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:42,073 INFO L225 Difference]: With dead ends: 1429 [2021-12-18 01:33:42,074 INFO L226 Difference]: Without dead ends: 1364 [2021-12-18 01:33:42,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:33:42,075 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 6 mSDsluCounter, 2637 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3325 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:42,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 3325 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 01:33:42,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-12-18 01:33:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2021-12-18 01:33:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 967 states have (on average 1.221302998965874) internal successors, (1181), 989 states have internal predecessors, (1181), 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) [2021-12-18 01:33:42,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1812 transitions. [2021-12-18 01:33:42,106 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1812 transitions. Word has length 157 [2021-12-18 01:33:42,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:42,106 INFO L470 AbstractCegarLoop]: Abstraction has 1364 states and 1812 transitions. [2021-12-18 01:33:42,107 INFO L471 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) [2021-12-18 01:33:42,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1812 transitions. [2021-12-18 01:33:42,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-18 01:33:42,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:42,108 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-12-18 01:33:42,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 01:33:42,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:42,327 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:42,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1916407917, now seen corresponding path program 1 times [2021-12-18 01:33:42,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:42,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304581912] [2021-12-18 01:33:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:42,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:33:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:33:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:33:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:33:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-18 01:33:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2021-12-18 01:33:42,536 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:42,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304581912] [2021-12-18 01:33:42,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304581912] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:42,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991387608] [2021-12-18 01:33:42,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:42,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:42,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:42,537 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) [2021-12-18 01:33:42,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 01:33:43,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 1953 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 01:33:43,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-18 01:33:43,186 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:33:43,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991387608] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:33:43,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:33:43,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 10 [2021-12-18 01:33:43,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106638349] [2021-12-18 01:33:43,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:33:43,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:33:43,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:43,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:33:43,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:33:43,188 INFO L87 Difference]: Start difference. First operand 1364 states and 1812 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 01:33:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:43,242 INFO L93 Difference]: Finished difference Result 2402 states and 3215 transitions. [2021-12-18 01:33:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:33:43,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2021-12-18 01:33:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:43,252 INFO L225 Difference]: With dead ends: 2402 [2021-12-18 01:33:43,253 INFO L226 Difference]: Without dead ends: 1364 [2021-12-18 01:33:43,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 194 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:33:43,258 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 3441 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4130 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:43,259 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4130 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:33:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2021-12-18 01:33:43,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1362. [2021-12-18 01:33:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 965 states have (on average 1.2207253886010363) internal successors, (1178), 988 states have internal predecessors, (1178), 302 states have call successors, (302), 92 states have call predecessors, (302), 94 states have return successors, (329), 296 states have call predecessors, (329), 300 states have call successors, (329) [2021-12-18 01:33:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1809 transitions. [2021-12-18 01:33:43,311 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1809 transitions. Word has length 158 [2021-12-18 01:33:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:43,312 INFO L470 AbstractCegarLoop]: Abstraction has 1362 states and 1809 transitions. [2021-12-18 01:33:43,312 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 01:33:43,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1809 transitions. [2021-12-18 01:33:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-18 01:33:43,314 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:43,314 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-12-18 01:33:43,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-12-18 01:33:43,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:43,535 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:43,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1960882547, now seen corresponding path program 2 times [2021-12-18 01:33:43,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:43,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462110928] [2021-12-18 01:33:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:43,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:33:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:33:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:33:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:33:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-18 01:33:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:43,843 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-18 01:33:43,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:43,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462110928] [2021-12-18 01:33:43,844 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462110928] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:43,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726901735] [2021-12-18 01:33:43,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:33:43,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:43,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:43,864 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) [2021-12-18 01:33:43,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 01:33:44,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 01:33:44,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:33:44,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 1951 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-18 01:33:44,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:44,856 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-18 01:33:44,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:33:45,431 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-18 01:33:45,431 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726901735] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:33:45,431 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:33:45,431 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 14] total 24 [2021-12-18 01:33:45,432 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135161575] [2021-12-18 01:33:45,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:33:45,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-18 01:33:45,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:45,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-18 01:33:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=413, Unknown=0, NotChecked=0, Total=552 [2021-12-18 01:33:45,438 INFO L87 Difference]: Start difference. First operand 1362 states and 1809 transitions. Second operand has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 22 states have internal predecessors, (223), 15 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (41), 13 states have call predecessors, (41), 14 states have call successors, (41) [2021-12-18 01:33:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:33:51,391 INFO L93 Difference]: Finished difference Result 3460 states and 4627 transitions. [2021-12-18 01:33:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-18 01:33:51,392 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 22 states have internal predecessors, (223), 15 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (41), 13 states have call predecessors, (41), 14 states have call successors, (41) Word has length 158 [2021-12-18 01:33:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:33:51,403 INFO L225 Difference]: With dead ends: 3460 [2021-12-18 01:33:51,404 INFO L226 Difference]: Without dead ends: 3457 [2021-12-18 01:33:51,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=457, Invalid=1103, Unknown=0, NotChecked=0, Total=1560 [2021-12-18 01:33:51,408 INFO L933 BasicCegarLoop]: 988 mSDtfsCounter, 5860 mSDsluCounter, 3301 mSDsCounter, 0 mSdLazyCounter, 5634 mSolverCounterSat, 2672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6202 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 8306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2672 IncrementalHoareTripleChecker+Valid, 5634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2021-12-18 01:33:51,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6202 Valid, 4289 Invalid, 8306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2672 Valid, 5634 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2021-12-18 01:33:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3457 states. [2021-12-18 01:33:51,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3386. [2021-12-18 01:33:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3386 states, 2393 states have (on average 1.226076055160886) internal successors, (2934), 2454 states have internal predecessors, (2934), 768 states have call successors, (768), 214 states have call predecessors, (768), 224 states have return successors, (853), 754 states have call predecessors, (853), 766 states have call successors, (853) [2021-12-18 01:33:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3386 states to 3386 states and 4555 transitions. [2021-12-18 01:33:51,494 INFO L78 Accepts]: Start accepts. Automaton has 3386 states and 4555 transitions. Word has length 158 [2021-12-18 01:33:51,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:33:51,495 INFO L470 AbstractCegarLoop]: Abstraction has 3386 states and 4555 transitions. [2021-12-18 01:33:51,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.291666666666666) internal successors, (223), 22 states have internal predecessors, (223), 15 states have call successors, (47), 13 states have call predecessors, (47), 12 states have return successors, (41), 13 states have call predecessors, (41), 14 states have call successors, (41) [2021-12-18 01:33:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3386 states and 4555 transitions. [2021-12-18 01:33:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-18 01:33:51,512 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:33:51,512 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:33:51,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 01:33:51,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:51,727 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:33:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:33:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash 507809139, now seen corresponding path program 3 times [2021-12-18 01:33:51,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:33:51,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069818830] [2021-12-18 01:33:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:33:51,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:33:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:33:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:33:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:33:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:33:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:33:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:33:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:33:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:33:51,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:33:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:33:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:33:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:33:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:33:51,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-18 01:33:51,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:33:51,990 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-12-18 01:33:51,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:33:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069818830] [2021-12-18 01:33:51,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069818830] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:33:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876601408] [2021-12-18 01:33:51,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 01:33:51,991 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:33:51,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:33:51,992 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) [2021-12-18 01:33:52,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 01:33:52,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-12-18 01:33:52,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:33:52,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 57 conjunts are in the unsatisfiable core [2021-12-18 01:33:52,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:33:52,745 INFO L388 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 [2021-12-18 01:33:52,748 INFO L388 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 [2021-12-18 01:33:52,869 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:33:52,869 INFO L388 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 [2021-12-18 01:33:52,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:52,874 INFO L388 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 [2021-12-18 01:33:53,018 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:33:53,018 INFO L388 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 [2021-12-18 01:33:53,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:53,023 INFO L388 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 [2021-12-18 01:33:57,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:57,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:57,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:33:57,315 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2021-12-18 01:33:57,318 INFO L354 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2021-12-18 01:33:57,318 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 13 [2021-12-18 01:33:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-12-18 01:33:57,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:33:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-12-18 01:33:57,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876601408] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:33:57,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:33:57,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 10] total 21 [2021-12-18 01:33:57,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816026885] [2021-12-18 01:33:57,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:33:57,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 01:33:57,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:33:57,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 01:33:57,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=352, Unknown=2, NotChecked=0, Total=420 [2021-12-18 01:33:57,741 INFO L87 Difference]: Start difference. First operand 3386 states and 4555 transitions. Second operand has 21 states, 20 states have (on average 6.1) internal successors, (122), 15 states have internal predecessors, (122), 8 states have call successors, (30), 8 states have call predecessors, (30), 5 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) [2021-12-18 01:34:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:03,297 INFO L93 Difference]: Finished difference Result 5887 states and 7901 transitions. [2021-12-18 01:34:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 01:34:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 6.1) internal successors, (122), 15 states have internal predecessors, (122), 8 states have call successors, (30), 8 states have call predecessors, (30), 5 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) Word has length 158 [2021-12-18 01:34:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:03,307 INFO L225 Difference]: With dead ends: 5887 [2021-12-18 01:34:03,307 INFO L226 Difference]: Without dead ends: 2739 [2021-12-18 01:34:03,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 338 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=100, Invalid=547, Unknown=3, NotChecked=0, Total=650 [2021-12-18 01:34:03,315 INFO L933 BasicCegarLoop]: 683 mSDtfsCounter, 160 mSDsluCounter, 6326 mSDsCounter, 0 mSdLazyCounter, 2241 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 7009 SdHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:03,315 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 7009 Invalid, 2693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2241 Invalid, 0 Unknown, 316 Unchecked, 3.4s Time] [2021-12-18 01:34:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2021-12-18 01:34:03,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2739. [2021-12-18 01:34:03,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2739 states, 1935 states have (on average 1.2227390180878552) internal successors, (2366), 1984 states have internal predecessors, (2366), 611 states have call successors, (611), 185 states have call predecessors, (611), 192 states have return successors, (672), 599 states have call predecessors, (672), 609 states have call successors, (672) [2021-12-18 01:34:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 3649 transitions. [2021-12-18 01:34:03,384 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 3649 transitions. Word has length 158 [2021-12-18 01:34:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:03,384 INFO L470 AbstractCegarLoop]: Abstraction has 2739 states and 3649 transitions. [2021-12-18 01:34:03,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 6.1) internal successors, (122), 15 states have internal predecessors, (122), 8 states have call successors, (30), 8 states have call predecessors, (30), 5 states have return successors, (22), 8 states have call predecessors, (22), 7 states have call successors, (22) [2021-12-18 01:34:03,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 3649 transitions. [2021-12-18 01:34:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-12-18 01:34:03,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:03,387 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:03,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:03,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-18 01:34:03,607 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1436807920, now seen corresponding path program 1 times [2021-12-18 01:34:03,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:03,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716246442] [2021-12-18 01:34:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:03,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:34:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:34:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:34:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:34:03,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:34:03,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:34:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:34:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:34:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:34:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:34:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-18 01:34:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2021-12-18 01:34:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:03,855 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-18 01:34:03,855 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:03,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716246442] [2021-12-18 01:34:03,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716246442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:34:03,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103097868] [2021-12-18 01:34:03,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:03,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:34:03,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:34:03,857 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) [2021-12-18 01:34:03,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 01:34:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:04,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 01:34:04,391 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:04,692 INFO L388 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 [2021-12-18 01:34:04,694 INFO L388 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 [2021-12-18 01:34:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-18 01:34:04,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:34:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-18 01:34:04,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103097868] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 01:34:04,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:34:04,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2021-12-18 01:34:04,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206796054] [2021-12-18 01:34:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:04,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:34:04,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:04,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:34:04,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-18 01:34:04,960 INFO L87 Difference]: Start difference. First operand 2739 states and 3649 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) [2021-12-18 01:34:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:06,007 INFO L93 Difference]: Finished difference Result 2872 states and 3811 transitions. [2021-12-18 01:34:06,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:34:06,008 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 [2021-12-18 01:34:06,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:06,016 INFO L225 Difference]: With dead ends: 2872 [2021-12-18 01:34:06,016 INFO L226 Difference]: Without dead ends: 2739 [2021-12-18 01:34:06,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 369 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:34:06,018 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 6 mSDsluCounter, 3224 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3911 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:06,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 3911 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-18 01:34:06,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2021-12-18 01:34:06,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 2739. [2021-12-18 01:34:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2739 states, 1935 states have (on average 1.2217054263565892) internal successors, (2364), 1984 states have internal predecessors, (2364), 611 states have call successors, (611), 185 states have call predecessors, (611), 192 states have return successors, (672), 599 states have call predecessors, (672), 609 states have call successors, (672) [2021-12-18 01:34:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 3647 transitions. [2021-12-18 01:34:06,076 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 3647 transitions. Word has length 168 [2021-12-18 01:34:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:06,077 INFO L470 AbstractCegarLoop]: Abstraction has 2739 states and 3647 transitions. [2021-12-18 01:34:06,078 INFO L471 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) [2021-12-18 01:34:06,078 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 3647 transitions. [2021-12-18 01:34:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-12-18 01:34:06,079 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:06,080 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:06,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:06,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-18 01:34:06,300 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:06,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:06,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2032139182, now seen corresponding path program 1 times [2021-12-18 01:34:06,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:06,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499139807] [2021-12-18 01:34:06,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:06,301 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:34:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:34:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:34:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:34:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:34:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:34:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:34:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:06,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:34:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:34:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:34:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 01:34:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 01:34:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-18 01:34:06,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:06,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499139807] [2021-12-18 01:34:06,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499139807] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:34:06,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627975700] [2021-12-18 01:34:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:06,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:34:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:34:06,581 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) [2021-12-18 01:34:06,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 01:34:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:07,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 1972 conjuncts, 47 conjunts are in the unsatisfiable core [2021-12-18 01:34:07,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:07,374 INFO L388 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 [2021-12-18 01:34:07,377 INFO L388 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 [2021-12-18 01:34:07,569 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:34:07,569 INFO L388 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 [2021-12-18 01:34:07,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:34:07,576 INFO L388 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 [2021-12-18 01:34:08,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:34:08,145 INFO L388 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 [2021-12-18 01:34:08,150 INFO L354 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2021-12-18 01:34:08,150 INFO L388 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 [2021-12-18 01:34:08,214 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 8 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2021-12-18 01:34:08,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:34:08,511 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-18 01:34:08,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627975700] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:34:08,512 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 01:34:08,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 17 [2021-12-18 01:34:08,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748002297] [2021-12-18 01:34:08,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 01:34:08,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 01:34:08,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 01:34:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2021-12-18 01:34:08,513 INFO L87 Difference]: Start difference. First operand 2739 states and 3647 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) [2021-12-18 01:34:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:10,668 INFO L93 Difference]: Finished difference Result 4560 states and 6039 transitions. [2021-12-18 01:34:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 01:34:10,669 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 [2021-12-18 01:34:10,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:10,678 INFO L225 Difference]: With dead ends: 4560 [2021-12-18 01:34:10,678 INFO L226 Difference]: Without dead ends: 2088 [2021-12-18 01:34:10,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 366 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2021-12-18 01:34:10,683 INFO L933 BasicCegarLoop]: 679 mSDtfsCounter, 318 mSDsluCounter, 5551 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 6230 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 533 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:10,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 6230 Invalid, 2153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1355 Invalid, 0 Unknown, 533 Unchecked, 2.0s Time] [2021-12-18 01:34:10,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2021-12-18 01:34:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2021-12-18 01:34:10,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 1475 states have (on average 1.2169491525423728) internal successors, (1795), 1512 states have internal predecessors, (1795), 452 states have call successors, (452), 156 states have call predecessors, (452), 160 states have return successors, (488), 442 states have call predecessors, (488), 450 states have call successors, (488) [2021-12-18 01:34:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2735 transitions. [2021-12-18 01:34:10,729 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2735 transitions. Word has length 169 [2021-12-18 01:34:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:10,729 INFO L470 AbstractCegarLoop]: Abstraction has 2088 states and 2735 transitions. [2021-12-18 01:34:10,729 INFO L471 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) [2021-12-18 01:34:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2735 transitions. [2021-12-18 01:34:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2021-12-18 01:34:10,731 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:10,731 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:10,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:10,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-12-18 01:34:10,950 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:10,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:10,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1191246487, now seen corresponding path program 1 times [2021-12-18 01:34:10,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:10,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988031426] [2021-12-18 01:34:10,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:10,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:10,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:34:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:34:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:34:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:34:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:34:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:34:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:34:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:11,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:34:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:11,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:34:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:34:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 01:34:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2021-12-18 01:34:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2021-12-18 01:34:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 01:34:11,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:11,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988031426] [2021-12-18 01:34:11,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988031426] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:34:11,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105882195] [2021-12-18 01:34:11,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:11,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:34:11,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:34:11,190 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) [2021-12-18 01:34:11,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 01:34:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:11,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 2004 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 01:34:11,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:12,079 INFO L388 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 [2021-12-18 01:34:12,082 INFO L388 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 [2021-12-18 01:34:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 01:34:12,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:34:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2021-12-18 01:34:12,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105882195] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 01:34:12,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:34:12,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10, 8] total 12 [2021-12-18 01:34:12,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965645849] [2021-12-18 01:34:12,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:12,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:34:12,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:34:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2021-12-18 01:34:12,381 INFO L87 Difference]: Start difference. First operand 2088 states and 2735 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) [2021-12-18 01:34:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:13,234 INFO L93 Difference]: Finished difference Result 2154 states and 2794 transitions. [2021-12-18 01:34:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:34:13,234 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 [2021-12-18 01:34:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:13,240 INFO L225 Difference]: With dead ends: 2154 [2021-12-18 01:34:13,240 INFO L226 Difference]: Without dead ends: 2059 [2021-12-18 01:34:13,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 391 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2021-12-18 01:34:13,243 INFO L933 BasicCegarLoop]: 678 mSDtfsCounter, 7 mSDsluCounter, 3176 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3854 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:13,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 3854 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-18 01:34:13,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2021-12-18 01:34:13,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 2059. [2021-12-18 01:34:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2059 states, 1460 states have (on average 1.2184931506849315) internal successors, (1779), 1497 states have internal predecessors, (1779), 438 states have call successors, (438), 156 states have call predecessors, (438), 160 states have return successors, (464), 428 states have call predecessors, (464), 436 states have call successors, (464) [2021-12-18 01:34:13,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2059 states to 2059 states and 2681 transitions. [2021-12-18 01:34:13,281 INFO L78 Accepts]: Start accepts. Automaton has 2059 states and 2681 transitions. Word has length 179 [2021-12-18 01:34:13,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:13,281 INFO L470 AbstractCegarLoop]: Abstraction has 2059 states and 2681 transitions. [2021-12-18 01:34:13,281 INFO L471 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) [2021-12-18 01:34:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2059 states and 2681 transitions. [2021-12-18 01:34:13,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-12-18 01:34:13,284 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:13,285 INFO L514 BasicCegarLoop]: 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, 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] [2021-12-18 01:34:13,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:13,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-12-18 01:34:13,500 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash -730439303, now seen corresponding path program 1 times [2021-12-18 01:34:13,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:13,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82117193] [2021-12-18 01:34:13,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:13,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:34:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:34:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:34:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:34:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:34:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:34:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:34:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:34:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:34:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:34:13,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 01:34:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 01:34:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 01:34:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 01:34:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-18 01:34:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-18 01:34:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-18 01:34:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-18 01:34:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-18 01:34:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-18 01:34:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-18 01:34:13,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-18 01:34:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2021-12-18 01:34:13,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:13,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82117193] [2021-12-18 01:34:13,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82117193] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:13,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:13,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-18 01:34:13,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046726806] [2021-12-18 01:34:13,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:13,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 01:34:13,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:13,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 01:34:13,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:34:13,802 INFO L87 Difference]: Start difference. First operand 2059 states and 2681 transitions. Second operand has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2021-12-18 01:34:16,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:16,278 INFO L93 Difference]: Finished difference Result 3837 states and 5036 transitions. [2021-12-18 01:34:16,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 01:34:16,278 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (27), 5 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 251 [2021-12-18 01:34:16,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:16,285 INFO L225 Difference]: With dead ends: 3837 [2021-12-18 01:34:16,285 INFO L226 Difference]: Without dead ends: 2092 [2021-12-18 01:34:16,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:34:16,289 INFO L933 BasicCegarLoop]: 637 mSDtfsCounter, 270 mSDsluCounter, 2582 mSDsCounter, 0 mSdLazyCounter, 1402 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 3219 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 1402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:16,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [279 Valid, 3219 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 1402 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2021-12-18 01:34:16,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2021-12-18 01:34:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 2052. [2021-12-18 01:34:16,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1455 states have (on average 1.2192439862542956) internal successors, (1774), 1492 states have internal predecessors, (1774), 438 states have call successors, (438), 156 states have call predecessors, (438), 158 states have return successors, (461), 426 states have call predecessors, (461), 436 states have call successors, (461) [2021-12-18 01:34:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2673 transitions. [2021-12-18 01:34:16,331 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2673 transitions. Word has length 251 [2021-12-18 01:34:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:16,332 INFO L470 AbstractCegarLoop]: Abstraction has 2052 states and 2673 transitions. [2021-12-18 01:34:16,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 5 states have internal predecessors, (118), 3 states have call successors, (27), 5 states have call predecessors, (27), 2 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2021-12-18 01:34:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2673 transitions. [2021-12-18 01:34:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2021-12-18 01:34:16,334 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:16,335 INFO L514 BasicCegarLoop]: 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, 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] [2021-12-18 01:34:16,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-18 01:34:16,335 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:16,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1586354599, now seen corresponding path program 1 times [2021-12-18 01:34:16,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:16,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520151851] [2021-12-18 01:34:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:16,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:34:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:34:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:34:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:34:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:34:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:34:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:34:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:34:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:34:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:34:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 01:34:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 01:34:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 01:34:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 01:34:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-18 01:34:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-18 01:34:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-18 01:34:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-18 01:34:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-18 01:34:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-18 01:34:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-18 01:34:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2021-12-18 01:34:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:16,568 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 01:34:16,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:16,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520151851] [2021-12-18 01:34:16,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520151851] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:16,568 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:16,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 01:34:16,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644867945] [2021-12-18 01:34:16,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:16,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:34:16,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:34:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:34:16,570 INFO L87 Difference]: Start difference. First operand 2052 states and 2673 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-18 01:34:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:18,663 INFO L93 Difference]: Finished difference Result 2112 states and 2772 transitions. [2021-12-18 01:34:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 01:34:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (27), 5 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 251 [2021-12-18 01:34:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:18,677 INFO L225 Difference]: With dead ends: 2112 [2021-12-18 01:34:18,678 INFO L226 Difference]: Without dead ends: 2102 [2021-12-18 01:34:18,678 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:34:18,679 INFO L933 BasicCegarLoop]: 808 mSDtfsCounter, 960 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:18,679 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1056 Valid, 2473 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-18 01:34:18,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2021-12-18 01:34:18,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 2052. [2021-12-18 01:34:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1455 states have (on average 1.2185567010309277) internal successors, (1773), 1492 states have internal predecessors, (1773), 438 states have call successors, (438), 156 states have call predecessors, (438), 158 states have return successors, (461), 426 states have call predecessors, (461), 436 states have call successors, (461) [2021-12-18 01:34:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2672 transitions. [2021-12-18 01:34:18,728 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2672 transitions. Word has length 251 [2021-12-18 01:34:18,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:18,728 INFO L470 AbstractCegarLoop]: Abstraction has 2052 states and 2672 transitions. [2021-12-18 01:34:18,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 4 states have internal predecessors, (115), 4 states have call successors, (27), 5 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2021-12-18 01:34:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2672 transitions. [2021-12-18 01:34:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2021-12-18 01:34:18,732 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:18,732 INFO L514 BasicCegarLoop]: 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, 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] [2021-12-18 01:34:18,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-18 01:34:18,732 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1150769733, now seen corresponding path program 1 times [2021-12-18 01:34:18,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:18,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035420042] [2021-12-18 01:34:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:18,733 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:34:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:34:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:34:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:34:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:34:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:34:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:34:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:34:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:34:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:34:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 01:34:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 01:34:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:18,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 01:34:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 01:34:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-18 01:34:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-18 01:34:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-18 01:34:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-18 01:34:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-18 01:34:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-18 01:34:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-18 01:34:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2021-12-18 01:34:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 01:34:19,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:19,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035420042] [2021-12-18 01:34:19,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035420042] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:34:19,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101955719] [2021-12-18 01:34:19,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:19,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:34:19,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:34:19,080 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) [2021-12-18 01:34:19,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-18 01:34:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:19,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 3025 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:34:19,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2021-12-18 01:34:20,240 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:20,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101955719] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:20,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:34:20,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2021-12-18 01:34:20,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595354236] [2021-12-18 01:34:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:20,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:34:20,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:20,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:34:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:34:20,245 INFO L87 Difference]: Start difference. First operand 2052 states and 2672 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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) [2021-12-18 01:34:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:20,467 INFO L93 Difference]: Finished difference Result 3782 states and 4937 transitions. [2021-12-18 01:34:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 01:34:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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 256 [2021-12-18 01:34:20,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:20,475 INFO L225 Difference]: With dead ends: 3782 [2021-12-18 01:34:20,475 INFO L226 Difference]: Without dead ends: 2056 [2021-12-18 01:34:20,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-18 01:34:20,481 INFO L933 BasicCegarLoop]: 888 mSDtfsCounter, 357 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:20,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [472 Valid, 1821 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:34:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2021-12-18 01:34:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2052. [2021-12-18 01:34:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2052 states, 1455 states have (on average 1.2171821305841923) internal successors, (1771), 1492 states have internal predecessors, (1771), 438 states have call successors, (438), 156 states have call predecessors, (438), 158 states have return successors, (461), 426 states have call predecessors, (461), 436 states have call successors, (461) [2021-12-18 01:34:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2670 transitions. [2021-12-18 01:34:20,597 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2670 transitions. Word has length 256 [2021-12-18 01:34:20,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:20,598 INFO L470 AbstractCegarLoop]: Abstraction has 2052 states and 2670 transitions. [2021-12-18 01:34:20,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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) [2021-12-18 01:34:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2670 transitions. [2021-12-18 01:34:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-18 01:34:20,601 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:20,601 INFO L514 BasicCegarLoop]: 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, 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] [2021-12-18 01:34:20,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-12-18 01:34:20,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 01:34:20,815 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:20,816 INFO L85 PathProgramCache]: Analyzing trace with hash -389631941, now seen corresponding path program 1 times [2021-12-18 01:34:20,816 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:20,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39195266] [2021-12-18 01:34:20,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:20,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-18 01:34:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-18 01:34:21,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-18 01:34:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2021-12-18 01:34:21,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2021-12-18 01:34:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2021-12-18 01:34:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-18 01:34:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-12-18 01:34:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-18 01:34:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2021-12-18 01:34:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2021-12-18 01:34:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-12-18 01:34:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-18 01:34:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2021-12-18 01:34:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2021-12-18 01:34:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2021-12-18 01:34:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2021-12-18 01:34:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2021-12-18 01:34:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2021-12-18 01:34:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:21,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2021-12-18 01:34:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2021-12-18 01:34:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-18 01:34:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2021-12-18 01:34:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2021-12-18 01:34:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2021-12-18 01:34:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2021-12-18 01:34:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2021-12-18 01:34:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2021-12-18 01:34:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:21,165 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 7 proven. 18 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2021-12-18 01:34:21,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 01:34:21,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39195266] [2021-12-18 01:34:21,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39195266] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 01:34:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932050893] [2021-12-18 01:34:21,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:21,166 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:34:21,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:34:21,167 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) [2021-12-18 01:34:21,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-18 01:34:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:22,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 3122 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 01:34:22,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2021-12-18 01:34:22,522 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:22,522 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932050893] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:22,522 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:34:22,522 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-12-18 01:34:22,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176709918] [2021-12-18 01:34:22,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:22,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:34:22,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 01:34:22,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:34:22,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:34:22,523 INFO L87 Difference]: Start difference. First operand 2052 states and 2670 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2021-12-18 01:34:22,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:22,689 INFO L93 Difference]: Finished difference Result 3786 states and 4955 transitions. [2021-12-18 01:34:22,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:34:22,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 276 [2021-12-18 01:34:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:22,696 INFO L225 Difference]: With dead ends: 3786 [2021-12-18 01:34:22,696 INFO L226 Difference]: Without dead ends: 2060 [2021-12-18 01:34:22,700 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-18 01:34:22,704 INFO L933 BasicCegarLoop]: 656 mSDtfsCounter, 12 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:22,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 1905 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:34:22,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2060 states. [2021-12-18 01:34:22,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2060 to 2060. [2021-12-18 01:34:22,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2060 states, 1462 states have (on average 1.216826265389877) internal successors, (1779), 1499 states have internal predecessors, (1779), 438 states have call successors, (438), 157 states have call predecessors, (438), 159 states have return successors, (461), 426 states have call predecessors, (461), 436 states have call successors, (461) [2021-12-18 01:34:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2060 states to 2060 states and 2678 transitions. [2021-12-18 01:34:22,795 INFO L78 Accepts]: Start accepts. Automaton has 2060 states and 2678 transitions. Word has length 276 [2021-12-18 01:34:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:22,796 INFO L470 AbstractCegarLoop]: Abstraction has 2060 states and 2678 transitions. [2021-12-18 01:34:22,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2021-12-18 01:34:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2060 states and 2678 transitions. [2021-12-18 01:34:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2021-12-18 01:34:22,798 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:22,798 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:34:22,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:23,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 01:34:23,020 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:23,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:23,021 INFO L85 PathProgramCache]: Analyzing trace with hash -246260549, now seen corresponding path program 1 times [2021-12-18 01:34:23,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 01:34:23,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956560468] [2021-12-18 01:34:23,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:23,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 01:34:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 01:34:25,051 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-18 01:34:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-18 01:34:26,269 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-18 01:34:26,269 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-18 01:34:26,270 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-18 01:34:26,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-18 01:34:26,277 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:34:26,279 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 01:34:26,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 01:34:26 BoogieIcfgContainer [2021-12-18 01:34:26,510 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 01:34:26,511 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 01:34:26,512 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 01:34:26,512 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 01:34:26,512 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:33:18" (3/4) ... [2021-12-18 01:34:26,516 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 01:34:26,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 01:34:26,516 INFO L158 Benchmark]: Toolchain (without parser) took 71445.64ms. Allocated memory was 83.9MB in the beginning and 805.3MB in the end (delta: 721.4MB). Free memory was 44.5MB in the beginning and 378.2MB in the end (delta: -333.7MB). Peak memory consumption was 387.2MB. Max. memory is 16.1GB. [2021-12-18 01:34:26,517 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 83.9MB. Free memory was 40.2MB in the beginning and 40.2MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 01:34:26,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1193.95ms. Allocated memory was 83.9MB in the beginning and 127.9MB in the end (delta: 44.0MB). Free memory was 44.5MB in the beginning and 67.6MB in the end (delta: -23.1MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2021-12-18 01:34:26,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.54ms. Allocated memory is still 127.9MB. Free memory was 67.6MB in the beginning and 57.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-18 01:34:26,518 INFO L158 Benchmark]: Boogie Preprocessor took 94.01ms. Allocated memory is still 127.9MB. Free memory was 57.1MB in the beginning and 45.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-18 01:34:26,519 INFO L158 Benchmark]: RCFGBuilder took 1953.14ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 45.2MB in the beginning and 119.7MB in the end (delta: -74.4MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. [2021-12-18 01:34:26,519 INFO L158 Benchmark]: TraceAbstraction took 68080.73ms. Allocated memory was 188.7MB in the beginning and 805.3MB in the end (delta: 616.6MB). Free memory was 119.7MB in the beginning and 378.2MB in the end (delta: -258.5MB). Peak memory consumption was 478.7MB. Max. memory is 16.1GB. [2021-12-18 01:34:26,519 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 805.3MB. Free memory is still 378.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 01:34:26,521 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.17ms. Allocated memory is still 83.9MB. Free memory was 40.2MB in the beginning and 40.2MB in the end (delta: 35.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1193.95ms. Allocated memory was 83.9MB in the beginning and 127.9MB in the end (delta: 44.0MB). Free memory was 44.5MB in the beginning and 67.6MB in the end (delta: -23.1MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.54ms. Allocated memory is still 127.9MB. Free memory was 67.6MB in the beginning and 57.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.01ms. Allocated memory is still 127.9MB. Free memory was 57.1MB in the beginning and 45.2MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1953.14ms. Allocated memory was 127.9MB in the beginning and 188.7MB in the end (delta: 60.8MB). Free memory was 45.2MB in the beginning and 119.7MB in the end (delta: -74.4MB). Peak memory consumption was 49.2MB. Max. memory is 16.1GB. * TraceAbstraction took 68080.73ms. Allocated memory was 188.7MB in the beginning and 805.3MB in the end (delta: 616.6MB). Free memory was 119.7MB in the beginning and 378.2MB in the end (delta: -258.5MB). Peak memory consumption was 478.7MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 805.3MB. Free memory is still 378.2MB. 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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=-2] [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={18446744073709551620:18446744073709551658}, 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=-2] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-2] [L6815] COND FALSE !(tmp___8 == 2) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-2] [L6818] COND FALSE !(tmp___8 == 3) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-2] [L6821] COND FALSE !(tmp___8 == 4) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-2] [L6824] COND FALSE !(tmp___8 == 5) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-2] [L6827] COND FALSE !(tmp___8 == 6) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-2] [L6830] COND TRUE tmp___8 == 7 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-2] [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={-4:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __mptr={-4:131}, __this_module={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, intf={18446744073709551632:0}, intf={18446744073709551632: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] [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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, 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:125}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=0, netdev={33:0}, netdev_priv((struct net_device const *)netdev)={33:125}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={-4:0}, tmp___8=0, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6320] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6323] CALL spinlock_check(& catc->tx_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:165}, 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:165}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:165}, lock={33:165}, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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:165}, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6326] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6343] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6346] CALL spinlock_check(& catc->ctrl_lock) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:229}, 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:229}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:229}, lock={33:229}, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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:229}, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6349] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6366] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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)={-4: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={18446744073709551620:18446744073709551658}, 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()={-4: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={18446744073709551620:18446744073709551658}, arbitrary_memory={-4: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={-4: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={-4:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, arbitrary_memory={-4: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={-4:0}] [L6379] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usb_alloc_urb(0, 208U)={-4:0}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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=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={18446744073709551620:18446744073709551658}, 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=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={18446744073709551620:18446744073709551658}, 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=1, 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)=1, \old(mem_flags)=208, \result={-6:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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}] [L6380] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usb_alloc_urb(0, 208U)={-6:0}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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)={-7: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={18446744073709551620:18446744073709551658}, 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()={-7: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={18446744073709551620:18446744073709551658}, arbitrary_memory={-7: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={-7: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={-7:0}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, arbitrary_memory={-7: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={-7:0}] [L6381] RET, EXPR usb_alloc_urb(0, 208U) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usb_alloc_urb(0, 208U)={-7:0}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usb_alloc_urb(0, 208U)={-8:0}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->ctrl_urb={-4:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->tx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->rx_urb={-7:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->irq_urb={-8:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}, usbdev->descriptor.idVendor=57] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-4: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] [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)=18446744073709551629, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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)=81, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:125}, context={33:125}, dev={-4:0}, dev={-4:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=81, 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={-4:0}, urb={-4: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={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-4: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] [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)=18446744073709551633, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->tx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:14}, context={33:125}, dev={-4: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, transfer_buffer={0:0}, 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)=0, \old(pipe)=22, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:125}, context={33:125}, dev={-4:0}, dev={-4:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=22, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={0:0}, transfer_buffer={0:0}, urb={-6:0}, urb={-6: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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->tx_urb={-6:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-4: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] [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)=18446744073709551655, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->rx_urb={-7:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, complete_fn={-1:15}, context={33:125}, dev={-4: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, transfer_buffer={33:46433}, urb={-7: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)=15, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:125}, context={33:125}, dev={-4:0}, dev={-4:0}, driver_name={25:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=15, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:46433}, transfer_buffer={33:46433}, urb={-7:0}, urb={-7: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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->rx_urb={-7:0}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-4: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] [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)=18446744073709551654, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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)=25, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:125}, context={33:125}, dev={-4:0}, dev={-4:0}, 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=25, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69503}, transfer_buffer={33:69503}, 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)=25, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:125}, context={33:125}, dev={-4:0}, dev={-4:0}, driver_name={25:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=25, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69503}, transfer_buffer={33:69503}, urb={-8:0}, urb={-8:0}] [L5148] urb->start_frame = -1 VAL [\old(buffer_length)=2, \old(interval)=1, \old(pipe)=25, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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:125}, context={33:125}, dev={-4:0}, dev={-4:0}, driver_name={25:0}, interval=1, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, ops={26:0}, pipe=25, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, transfer_buffer={33:69503}, transfer_buffer={33:69503}, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->is_f5u011=70, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6607] CALL 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={18446744073709551620:18446744073709551658}, 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] [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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={0:0}, buf={0:0}, catc={33:125}, catc={33:125}, 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, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={0:0}, buf={0:0}, catc={33:125}, catc={33:125}, catc->usbdev={-4:0}, 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, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-4: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] [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(value)=0, __create_pipe(catc->usbdev, 0U)=18446744073709551699, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={0:0}, buf={0:0}, catc={33:125}, catc={33:125}, catc->usbdev={-4:0}, 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, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={0:0}, buf={0:0}, catc={33:125}, catc={33:125}, 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=83, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={0:0}, buf={0:0}, catc={33:125}, catc={33:125}, 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=-9, tmp___10=-9, tmp___8=83, tmp___9=85, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={0:0}, buf={0:0}, catc={33:125}, catc={33:125}, 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=-9, tmp___10=-9, tmp___11=-9, tmp___8=83, tmp___9=85, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=0, \old(len)=0, \old(request)=244, \old(value)=0, \result=-9, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={0:0}, buf={0:0}, catc={33:125}, catc={33:125}, 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=-9, tmp___10=-9, tmp___11=-9, tmp___8=83, tmp___9=85, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_ctrl_msg(catc, (u8 )0, (u8 )244, (u16 )0, (u16 )0, (void *)0, 0)=-9, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6608] EXPR netdev->dev_addr VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551683:18446744073709551685}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6608-L6609] CALL 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={18446744073709551620:18446744073709551658}, 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] [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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={18446744073709551683:18446744073709551685}, buf={18446744073709551683:18446744073709551685}, catc={33:125}, catc={33:125}, 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, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={18446744073709551683:18446744073709551685}, buf={18446744073709551683:18446744073709551685}, catc={33:125}, catc={33:125}, catc->usbdev={-4:0}, 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, value=0] [L5686] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-4: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] [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(value)=0, __create_pipe(catc->usbdev, 0U)=18446744073709551686, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={18446744073709551683:18446744073709551685}, buf={18446744073709551683:18446744073709551685}, catc={33:125}, catc={33:125}, catc->usbdev={-4:0}, 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, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={18446744073709551683:18446744073709551685}, buf={18446744073709551683:18446744073709551685}, catc={33:125}, catc={33:125}, 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=70, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={18446744073709551683:18446744073709551685}, buf={18446744073709551683:18446744073709551685}, catc={33:125}, catc={33:125}, 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=-10, tmp___10=-10, tmp___7=70, tmp___9=23, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={18446744073709551683:18446744073709551685}, buf={18446744073709551683:18446744073709551685}, catc={33:125}, catc={33:125}, 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=-10, tmp___10=-10, tmp___11=-10, tmp___7=70, tmp___9=23, value=0] [L5705] return (tmp___11); VAL [\old(dir)=128, \old(index)=0, \old(len)=6, \old(request)=242, \old(value)=0, \result=-10, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={18446744073709551683:18446744073709551685}, buf={18446744073709551683:18446744073709551685}, catc={33:125}, catc={33:125}, 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=-10, tmp___10=-10, tmp___11=-10, tmp___7=70, tmp___9=23, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_ctrl_msg(catc, (u8 )128, (u8 )242, (u16 )0, (u16 )0, (void *)netdev->dev_addr, 6)=-10, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, ldv_coherent_state=0, LDV_IN_INTERRUPT=1, ldv_urb_state=4, netdev={33:0}, netdev->dev_addr={18446744073709551683:18446744073709551685}, ops={26:0}, pktsz=23070, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___10=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6612] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6622-L6623] CALL 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={18446744073709551620:18446744073709551658}, 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] [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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={33:70238}, buf={33:70238}, catc={33:125}, catc={33:125}, 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, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={33:70238}, buf={33:70238}, catc={33:125}, catc={33:125}, catc->usbdev={-4:0}, 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, value=0] [L5691] CALL, EXPR __create_pipe(catc->usbdev, 0U) VAL [\old(endpoint)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={-4: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] [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(value)=0, __create_pipe(catc->usbdev, 0U)=18446744073709551698, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={33:70238}, buf={33:70238}, catc={33:125}, catc={33:125}, catc->usbdev={-4:0}, 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, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={33:70238}, buf={33:70238}, catc={33:125}, catc={33:125}, 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=82, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={33:70238}, buf={33:70238}, catc={33:125}, catc={33:125}, 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=-11, tmp___10=-11, tmp___8=82, tmp___9=30, 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(value)=0, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={33:70238}, buf={33:70238}, catc={33:125}, catc={33:125}, 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=-11, tmp___10=-11, tmp___11=-11, tmp___8=82, tmp___9=30, value=0] [L5705] return (tmp___11); VAL [\old(dir)=0, \old(index)=1, \old(len)=2, \old(request)=245, \old(value)=0, \result=-11, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, buf={33:70238}, buf={33:70238}, catc={33:125}, catc={33:125}, 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=-11, tmp___10=-11, tmp___11=-11, tmp___8=82, tmp___9=30, 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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_ctrl_msg(catc, (u8 )0, (u8 )245, (u16 )0, (u16 )1, (void *)(catc->rxmode), 2)=-11, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6627] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [L6634] catc->is_f5u011 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc->is_f5u011=70, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___14={21:0}, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, 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] [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={18446744073709551620:18446744073709551658}, broadcast={55:0}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, i={53:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___14={21:0}, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, catc={33:125}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, driver_name={25:0}, id={18446744073709551681:18446744073709551626}, id={18446744073709551681:18446744073709551626}, intf={18446744073709551632:0}, intf={18446744073709551632:0}, 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=13, tmp___11=17, tmp___12=39, tmp___13=38, tmp___14={21:0}, tmp___15=0, tmp___7={-4:0}, tmp___8=0, tmp___9={33:125}, usbdev={-4:0}] [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={18446744073709551620:18446744073709551658}, 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=-2, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group5={18446744073709551632:0}] [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={18446744073709551620:18446744073709551658}, 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=-2, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group5={18446744073709551632:0}] [L6793] COND TRUE 1 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-2, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group5={18446744073709551632: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={18446744073709551620:18446744073709551658}, 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=-12, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group5={18446744073709551632:0}] [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={18446744073709551620:18446744073709551658}, 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=-12, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group5={18446744073709551632:0}] [L6812] COND FALSE !(tmp___8 == 1) VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-12, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group5={18446744073709551632:0}] [L6815] COND TRUE tmp___8 == 2 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-12, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group5={18446744073709551632:0}] [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={18446744073709551620:18446744073709551658}, 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={18446744073709551645:159}, netdev={18446744073709551645:159}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [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={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={18446744073709551645:159}, 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] [L4928] return ((void *)((char *)dev + ((sizeof(struct net_device ) + 31UL) & 0x0fffffffffffffe0UL))); VAL [\result={18446744073709551645:90}, __key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, catc_driver={32:0}, catc_id_table={31:0}, catc_netdev_ops={27:0}, dev={18446744073709551645:159}, dev={18446744073709551645:159}, 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] [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={18446744073709551620:18446744073709551658}, 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={18446744073709551645:159}, netdev={18446744073709551645:159}, netdev_priv((struct net_device const *)netdev)={18446744073709551645:90}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0] [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={18446744073709551620:18446744073709551658}, catc={18446744073709551645:90}, catc->irq_urb={18446744073709551684: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={18446744073709551645:159}, netdev={18446744073709551645:159}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551645:90}] [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={18446744073709551620:18446744073709551658}, arg0={18446744073709551684: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] [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={18446744073709551620:18446744073709551658}, catc={18446744073709551645:90}, catc->irq_urb={18446744073709551684: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={18446744073709551645:159}, netdev={18446744073709551645:159}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, tmp___7={18446744073709551645:90}, 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={18446744073709551620:18446744073709551658}, catc={18446744073709551645:90}, 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={18446744073709551645:159}, netdev={18446744073709551645:159}, ops={26:0}, res_catc_open_15=0, res_catc_probe_17=0, res_catc_stop_16=0, status=-1, tmp___7={18446744073709551645:90}] [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={18446744073709551620:18446744073709551658}, 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=-12, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group1={18446744073709551645:159}, var_group5={18446744073709551632:0}] [L6857] COND TRUE res_catc_open_15 < 0 VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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=-12, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group1={18446744073709551645:159}, var_group5={18446744073709551632:0}] [L6934] CALL catc_exit() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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] [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={18446744073709551620:18446744073709551658}, 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=-12, var_catc_probe_17_p1={18446744073709551681:18446744073709551626}, var_group1={18446744073709551645:159}, var_group5={18446744073709551632:0}] [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={18446744073709551620:18446744073709551658}, 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] [L7084] CALL ldv_blast_assert() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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] [L6946] reach_error() VAL [__key___10={29:0}, __key___11={30:0}, __key___9={28:0}, __this_module={18446744073709551620:18446744073709551658}, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 37 procedures, 540 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.8s, OverallIterations: 20, TraceHistogramMax: 7, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12513 SdHoareTripleChecker+Valid, 28.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11643 mSDsluCounter, 66084 SdHoareTripleChecker+Invalid, 25.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1191 IncrementalHoareTripleChecker+Unchecked, 51885 mSDsCounter, 5039 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19091 IncrementalHoareTripleChecker+Invalid, 25321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5039 mSolverCounterUnsat, 14199 mSDtfsCounter, 19091 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4475 GetRequests, 4189 SyntacticMatches, 42 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3386occurred in iteration=11, InterpolantAutomatonStates: 186, 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, 19 MinimizatonAttempts, 277 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 5.6s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 5467 NumberOfCodeBlocks, 5407 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 6434 ConstructedInterpolants, 162 QuantifiedInterpolants, 17930 SizeOfPredicates, 49 NumberOfNonLiveVariables, 27059 ConjunctsInSsa, 326 ConjunctsInUnsatCore, 40 InterpolantComputations, 14 PerfectInterpolantSequences, 4672/4932 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 [2021-12-18 01:34:26,581 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-tmp.no-commuhash-c3fed41 [2021-12-18 01:34:28,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 01:34:28,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 01:34:28,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 01:34:28,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 01:34:28,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 01:34:28,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 01:34:28,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 01:34:28,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 01:34:28,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 01:34:28,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 01:34:28,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 01:34:28,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 01:34:28,532 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 01:34:28,533 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 01:34:28,534 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 01:34:28,535 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 01:34:28,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 01:34:28,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 01:34:28,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 01:34:28,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 01:34:28,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 01:34:28,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 01:34:28,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 01:34:28,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 01:34:28,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 01:34:28,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 01:34:28,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 01:34:28,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 01:34:28,568 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 01:34:28,568 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 01:34:28,569 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 01:34:28,570 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 01:34:28,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 01:34:28,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 01:34:28,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 01:34:28,573 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 01:34:28,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 01:34:28,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 01:34:28,574 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 01:34:28,575 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 01:34:28,576 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2021-12-18 01:34:28,611 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 01:34:28,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 01:34:28,613 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 01:34:28,613 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 01:34:28,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 01:34:28,614 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 01:34:28,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 01:34:28,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 01:34:28,615 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 01:34:28,615 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 01:34:28,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 01:34:28,616 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-18 01:34:28,616 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 01:34:28,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-18 01:34:28,617 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 01:34:28,617 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 01:34:28,617 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 01:34:28,617 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-18 01:34:28,617 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 01:34:28,617 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-18 01:34:28,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 01:34:28,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 01:34:28,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 01:34:28,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:34:28,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 01:34:28,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 01:34:28,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-18 01:34:28,619 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 01:34:28,619 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 01:34:28,619 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-18 01:34:28,619 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-18 01:34:28,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-18 01:34:28,619 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 01:34:28,620 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 01:34:28,620 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 [2021-12-18 01:34:28,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 01:34:28,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 01:34:28,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 01:34:28,906 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 01:34:28,907 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 01:34:28,907 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 [2021-12-18 01:34:28,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be73e0d7e/ceee18fa3ffc464faa4cb69f32b4fc21/FLAGae7ef8dcf [2021-12-18 01:34:29,766 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 01:34:29,767 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 [2021-12-18 01:34:29,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be73e0d7e/ceee18fa3ffc464faa4cb69f32b4fc21/FLAGae7ef8dcf [2021-12-18 01:34:29,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be73e0d7e/ceee18fa3ffc464faa4cb69f32b4fc21 [2021-12-18 01:34:29,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 01:34:29,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 01:34:29,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 01:34:29,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 01:34:29,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 01:34:29,956 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:34:29" (1/1) ... [2021-12-18 01:34:29,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10fab3d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:29, skipping insertion in model container [2021-12-18 01:34:29,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 01:34:29" (1/1) ... [2021-12-18 01:34:29,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 01:34:30,052 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 01:34:31,173 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] [2021-12-18 01:34:31,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:34:31,265 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-18 01:34:31,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 01:34:31,460 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] [2021-12-18 01:34:31,471 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:34:31,502 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 01:34:31,725 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] [2021-12-18 01:34:31,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 01:34:31,997 INFO L208 MainTranslator]: Completed translation [2021-12-18 01:34:31,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31 WrapperNode [2021-12-18 01:34:31,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 01:34:31,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 01:34:31,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 01:34:31,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 01:34:32,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,102 INFO L137 Inliner]: procedures = 157, calls = 839, calls flagged for inlining = 59, calls inlined = 40, statements flattened = 1605 [2021-12-18 01:34:32,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 01:34:32,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 01:34:32,103 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 01:34:32,103 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 01:34:32,108 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,119 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,123 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 01:34:32,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 01:34:32,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 01:34:32,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 01:34:32,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (1/1) ... [2021-12-18 01:34:32,185 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 01:34:32,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 01:34:32,200 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) [2021-12-18 01:34:32,202 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 [2021-12-18 01:34:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2021-12-18 01:34:32,231 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2021-12-18 01:34:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure catc_tx_run [2021-12-18 01:34:32,231 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_tx_run [2021-12-18 01:34:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-18 01:34:32,231 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2021-12-18 01:34:32,231 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2021-12-18 01:34:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2021-12-18 01:34:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 01:34:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2021-12-18 01:34:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2021-12-18 01:34:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2021-12-18 01:34:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure netif_tx_start_queue [2021-12-18 01:34:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_tx_start_queue [2021-12-18 01:34:32,232 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2021-12-18 01:34:32,232 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2021-12-18 01:34:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_run [2021-12-18 01:34:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_run [2021-12-18 01:34:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure catc_get_drvinfo [2021-12-18 01:34:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_get_drvinfo [2021-12-18 01:34:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_msg [2021-12-18 01:34:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_msg [2021-12-18 01:34:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2021-12-18 01:34:32,233 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2021-12-18 01:34:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-18 01:34:32,234 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-18 01:34:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-18 01:34:32,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-18 01:34:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure catc_multicast [2021-12-18 01:34:32,234 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_multicast [2021-12-18 01:34:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-12-18 01:34:32,234 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-12-18 01:34:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2021-12-18 01:34:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2021-12-18 01:34:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2021-12-18 01:34:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2021-12-18 01:34:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2021-12-18 01:34:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2021-12-18 01:34:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2021-12-18 01:34:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2021-12-18 01:34:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2021-12-18 01:34:32,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2021-12-18 01:34:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2021-12-18 01:34:32,236 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2021-12-18 01:34:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2021-12-18 01:34:32,236 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2021-12-18 01:34:32,236 INFO L130 BoogieDeclarations]: Found specification of procedure netif_stop_queue [2021-12-18 01:34:32,237 INFO L138 BoogieDeclarations]: Found implementation of procedure netif_stop_queue [2021-12-18 01:34:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 01:34:32,237 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2021-12-18 01:34:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2021-12-18 01:34:32,238 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2021-12-18 01:34:32,238 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2021-12-18 01:34:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2021-12-18 01:34:32,239 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2021-12-18 01:34:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 01:34:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 01:34:32,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 01:34:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2021-12-18 01:34:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2021-12-18 01:34:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2021-12-18 01:34:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure catc_ctrl_async [2021-12-18 01:34:32,240 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_ctrl_async [2021-12-18 01:34:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 01:34:32,240 INFO L130 BoogieDeclarations]: Found specification of procedure catc_exit [2021-12-18 01:34:32,241 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_exit [2021-12-18 01:34:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure mod_timer [2021-12-18 01:34:32,241 INFO L138 BoogieDeclarations]: Found implementation of procedure mod_timer [2021-12-18 01:34:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2021-12-18 01:34:32,241 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2021-12-18 01:34:32,241 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2021-12-18 01:34:32,242 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2021-12-18 01:34:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure catc_init [2021-12-18 01:34:32,242 INFO L138 BoogieDeclarations]: Found implementation of procedure catc_init [2021-12-18 01:34:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2021-12-18 01:34:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-12-18 01:34:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2021-12-18 01:34:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2021-12-18 01:34:32,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2021-12-18 01:34:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 01:34:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 01:34:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 01:34:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2021-12-18 01:34:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 01:34:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2021-12-18 01:34:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2021-12-18 01:34:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2021-12-18 01:34:32,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2021-12-18 01:34:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2021-12-18 01:34:32,244 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2021-12-18 01:34:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2021-12-18 01:34:32,245 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2021-12-18 01:34:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-18 01:34:32,245 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-18 01:34:32,245 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2021-12-18 01:34:32,246 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2021-12-18 01:34:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2021-12-18 01:34:32,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2021-12-18 01:34:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2021-12-18 01:34:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2021-12-18 01:34:32,246 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2021-12-18 01:34:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2021-12-18 01:34:32,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 01:34:32,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 01:34:32,507 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 01:34:32,509 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 01:34:42,883 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2021-12-18 01:34:42,967 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:34:42,975 WARN L815 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-18 01:34:53,834 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-12-18 01:34:53,834 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-12-18 01:34:53,834 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2021-12-18 01:34:53,834 INFO L768 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2021-12-18 01:34:53,854 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 01:34:53,866 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 01:34:53,866 INFO L301 CfgBuilder]: Removed 30 assume(true) statements. [2021-12-18 01:34:53,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:34:53 BoogieIcfgContainer [2021-12-18 01:34:53,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 01:34:53,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 01:34:53,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 01:34:53,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 01:34:53,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 01:34:29" (1/3) ... [2021-12-18 01:34:53,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e3bdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:34:53, skipping insertion in model container [2021-12-18 01:34:53,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 01:34:31" (2/3) ... [2021-12-18 01:34:53,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16e3bdb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 01:34:53, skipping insertion in model container [2021-12-18 01:34:53,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 01:34:53" (3/3) ... [2021-12-18 01:34:53,880 INFO L111 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-net-usb-catc.ko.cil.out.i [2021-12-18 01:34:53,886 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 01:34:53,886 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-18 01:34:53,928 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 01:34:53,935 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 01:34:53,935 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-18 01:34:53,957 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) [2021-12-18 01:34:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 01:34:53,961 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:53,961 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:34:53,961 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:53,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1343427639, now seen corresponding path program 1 times [2021-12-18 01:34:53,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:53,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479376700] [2021-12-18 01:34:53,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:53,977 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:53,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:53,979 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) [2021-12-18 01:34:53,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 01:34:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:54,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 01:34:54,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:54,527 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:54,527 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:54,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479376700] [2021-12-18 01:34:54,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479376700] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:54,528 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:54,528 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:34:54,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29553951] [2021-12-18 01:34:54,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:54,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:34:54,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:34:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:34:54,594 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) [2021-12-18 01:34:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:54,771 INFO L93 Difference]: Finished difference Result 1076 states and 1560 transitions. [2021-12-18 01:34:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 01:34:54,774 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 [2021-12-18 01:34:54,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:54,787 INFO L225 Difference]: With dead ends: 1076 [2021-12-18 01:34:54,787 INFO L226 Difference]: Without dead ends: 540 [2021-12-18 01:34:54,793 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:54,797 INFO L933 BasicCegarLoop]: 709 mSDtfsCounter, 301 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 3141 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:54,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [400 Valid, 3141 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:34:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-12-18 01:34:54,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 535. [2021-12-18 01:34:54,913 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) [2021-12-18 01:34:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 700 transitions. [2021-12-18 01:34:54,924 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 700 transitions. Word has length 17 [2021-12-18 01:34:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:54,925 INFO L470 AbstractCegarLoop]: Abstraction has 535 states and 700 transitions. [2021-12-18 01:34:54,926 INFO L471 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) [2021-12-18 01:34:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 700 transitions. [2021-12-18 01:34:54,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 01:34:54,927 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:54,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:34:54,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:55,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:55,144 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:55,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:55,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1736454649, now seen corresponding path program 1 times [2021-12-18 01:34:55,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:55,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696261731] [2021-12-18 01:34:55,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:55,146 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:55,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:55,153 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) [2021-12-18 01:34:55,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 01:34:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:55,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:34:55,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:55,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:55,841 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:55,841 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:55,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696261731] [2021-12-18 01:34:55,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696261731] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:55,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:55,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 01:34:55,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055585905] [2021-12-18 01:34:55,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:55,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:34:55,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:55,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:34:55,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:34:55,844 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) [2021-12-18 01:34:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:55,935 INFO L93 Difference]: Finished difference Result 1565 states and 2072 transitions. [2021-12-18 01:34:55,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:34:55,936 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 [2021-12-18 01:34:55,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:55,948 INFO L225 Difference]: With dead ends: 1565 [2021-12-18 01:34:55,948 INFO L226 Difference]: Without dead ends: 1048 [2021-12-18 01:34:55,951 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:55,955 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:34:55,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 1649 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:34:55,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-12-18 01:34:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1045. [2021-12-18 01:34:56,019 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) [2021-12-18 01:34:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1376 transitions. [2021-12-18 01:34:56,027 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1376 transitions. Word has length 17 [2021-12-18 01:34:56,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:56,027 INFO L470 AbstractCegarLoop]: Abstraction has 1045 states and 1376 transitions. [2021-12-18 01:34:56,027 INFO L471 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) [2021-12-18 01:34:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1376 transitions. [2021-12-18 01:34:56,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-18 01:34:56,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:56,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:34:56,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:56,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:56,262 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash 2004221234, now seen corresponding path program 1 times [2021-12-18 01:34:56,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:56,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125711418] [2021-12-18 01:34:56,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:56,265 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:56,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:56,268 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) [2021-12-18 01:34:56,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 01:34:56,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:56,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:34:56,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:56,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:56,866 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:56,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125711418] [2021-12-18 01:34:56,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125711418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:56,866 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:56,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 01:34:56,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602140873] [2021-12-18 01:34:56,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:56,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:34:56,867 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:56,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:34:56,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:34:56,867 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) [2021-12-18 01:34:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:56,895 INFO L93 Difference]: Finished difference Result 1047 states and 1377 transitions. [2021-12-18 01:34:56,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:34:56,895 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 [2021-12-18 01:34:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:56,899 INFO L225 Difference]: With dead ends: 1047 [2021-12-18 01:34:56,899 INFO L226 Difference]: Without dead ends: 1036 [2021-12-18 01:34:56,900 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:56,901 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:34:56,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [678 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:34:56,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2021-12-18 01:34:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 1031. [2021-12-18 01:34:56,932 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) [2021-12-18 01:34:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1356 transitions. [2021-12-18 01:34:56,938 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1356 transitions. Word has length 18 [2021-12-18 01:34:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:56,938 INFO L470 AbstractCegarLoop]: Abstraction has 1031 states and 1356 transitions. [2021-12-18 01:34:56,938 INFO L471 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) [2021-12-18 01:34:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1356 transitions. [2021-12-18 01:34:56,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-18 01:34:56,941 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:56,941 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:56,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-18 01:34:57,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:57,176 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:57,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:57,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1305048404, now seen corresponding path program 1 times [2021-12-18 01:34:57,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:57,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833999200] [2021-12-18 01:34:57,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:57,179 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:57,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:57,180 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) [2021-12-18 01:34:57,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 01:34:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:57,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 01:34:57,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:57,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:57,862 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:57,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833999200] [2021-12-18 01:34:57,862 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833999200] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:57,862 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:57,862 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 01:34:57,863 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023251507] [2021-12-18 01:34:57,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:57,863 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 01:34:57,863 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:57,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 01:34:57,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 01:34:57,864 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) [2021-12-18 01:34:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:57,960 INFO L93 Difference]: Finished difference Result 2353 states and 3158 transitions. [2021-12-18 01:34:57,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 01:34:57,960 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 [2021-12-18 01:34:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:57,965 INFO L225 Difference]: With dead ends: 2353 [2021-12-18 01:34:57,966 INFO L226 Difference]: Without dead ends: 1334 [2021-12-18 01:34:57,968 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:57,969 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:34:57,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 1302 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:34:57,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2021-12-18 01:34:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1330. [2021-12-18 01:34:58,008 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) [2021-12-18 01:34:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1804 transitions. [2021-12-18 01:34:58,015 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1804 transitions. Word has length 50 [2021-12-18 01:34:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:58,015 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1804 transitions. [2021-12-18 01:34:58,016 INFO L471 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) [2021-12-18 01:34:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1804 transitions. [2021-12-18 01:34:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-12-18 01:34:58,019 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:58,020 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:58,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:58,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:58,242 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:58,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:58,242 INFO L85 PathProgramCache]: Analyzing trace with hash -518166049, now seen corresponding path program 1 times [2021-12-18 01:34:58,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:58,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145842552] [2021-12-18 01:34:58,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:58,243 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:58,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:58,245 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) [2021-12-18 01:34:58,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 01:34:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:34:58,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:34:58,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:34:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:34:59,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:34:59,112 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:34:59,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145842552] [2021-12-18 01:34:59,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145842552] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:34:59,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:34:59,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 01:34:59,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964891616] [2021-12-18 01:34:59,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:34:59,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:34:59,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:34:59,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:34:59,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:34:59,113 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) [2021-12-18 01:34:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:34:59,395 INFO L93 Difference]: Finished difference Result 2669 states and 3616 transitions. [2021-12-18 01:34:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:34:59,396 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 [2021-12-18 01:34:59,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:34:59,403 INFO L225 Difference]: With dead ends: 2669 [2021-12-18 01:34:59,403 INFO L226 Difference]: Without dead ends: 1343 [2021-12-18 01:34:59,408 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:34:59,410 INFO L933 BasicCegarLoop]: 698 mSDtfsCounter, 12 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:34:59,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 2075 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:34:59,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2021-12-18 01:34:59,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1333. [2021-12-18 01:34:59,465 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) [2021-12-18 01:34:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1804 transitions. [2021-12-18 01:34:59,470 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1804 transitions. Word has length 72 [2021-12-18 01:34:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:34:59,471 INFO L470 AbstractCegarLoop]: Abstraction has 1333 states and 1804 transitions. [2021-12-18 01:34:59,472 INFO L471 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) [2021-12-18 01:34:59,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1804 transitions. [2021-12-18 01:34:59,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-18 01:34:59,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:34:59,474 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:34:59,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 01:34:59,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:34:59,691 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:34:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:34:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash -84772232, now seen corresponding path program 1 times [2021-12-18 01:34:59,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:34:59,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784517435] [2021-12-18 01:34:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:34:59,692 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:34:59,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:34:59,704 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) [2021-12-18 01:34:59,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 01:35:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:00,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 01:35:00,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:00,399 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 01:35:00,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:00,399 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:00,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784517435] [2021-12-18 01:35:00,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784517435] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:00,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:00,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 01:35:00,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579226119] [2021-12-18 01:35:00,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:00,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 01:35:00,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:00,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 01:35:00,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 01:35:00,401 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) [2021-12-18 01:35:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:00,609 INFO L93 Difference]: Finished difference Result 2675 states and 3616 transitions. [2021-12-18 01:35:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 01:35:00,609 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 [2021-12-18 01:35:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:00,614 INFO L225 Difference]: With dead ends: 2675 [2021-12-18 01:35:00,615 INFO L226 Difference]: Without dead ends: 1346 [2021-12-18 01:35:00,640 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:35:00,641 INFO L933 BasicCegarLoop]: 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 [2021-12-18 01:35:00,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 2062 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 01:35:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2021-12-18 01:35:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1330. [2021-12-18 01:35:00,671 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) [2021-12-18 01:35:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1798 transitions. [2021-12-18 01:35:00,676 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1798 transitions. Word has length 80 [2021-12-18 01:35:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:00,677 INFO L470 AbstractCegarLoop]: Abstraction has 1330 states and 1798 transitions. [2021-12-18 01:35:00,677 INFO L471 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) [2021-12-18 01:35:00,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1798 transitions. [2021-12-18 01:35:00,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-18 01:35:00,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:00,682 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:00,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:00,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:00,898 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:00,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:00,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2140419496, now seen corresponding path program 1 times [2021-12-18 01:35:00,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:00,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588514195] [2021-12-18 01:35:00,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:00,900 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:00,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:00,902 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) [2021-12-18 01:35:00,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 01:35:01,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:01,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-18 01:35:01,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-18 01:35:02,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:02,068 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:02,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588514195] [2021-12-18 01:35:02,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588514195] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:02,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:02,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 01:35:02,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836921468] [2021-12-18 01:35:02,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:02,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 01:35:02,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:02,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 01:35:02,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 01:35:02,069 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) [2021-12-18 01:35:02,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:02,777 INFO L93 Difference]: Finished difference Result 2671 states and 3615 transitions. [2021-12-18 01:35:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:35:02,778 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 [2021-12-18 01:35:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:02,782 INFO L225 Difference]: With dead ends: 2671 [2021-12-18 01:35:02,782 INFO L226 Difference]: Without dead ends: 1351 [2021-12-18 01:35:02,785 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:35:02,785 INFO L933 BasicCegarLoop]: 702 mSDtfsCounter, 13 mSDsluCounter, 2783 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 3485 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:02,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 3485 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 01:35:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2021-12-18 01:35:02,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1337. [2021-12-18 01:35:02,821 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) [2021-12-18 01:35:02,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1808 transitions. [2021-12-18 01:35:02,825 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1808 transitions. Word has length 146 [2021-12-18 01:35:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:02,827 INFO L470 AbstractCegarLoop]: Abstraction has 1337 states and 1808 transitions. [2021-12-18 01:35:02,827 INFO L471 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) [2021-12-18 01:35:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1808 transitions. [2021-12-18 01:35:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2021-12-18 01:35:02,828 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:02,828 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:02,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 01:35:03,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:03,048 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:03,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 971530265, now seen corresponding path program 1 times [2021-12-18 01:35:03,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:03,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052025578] [2021-12-18 01:35:03,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:03,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:03,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:03,051 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) [2021-12-18 01:35:03,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 01:35:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:03,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 1133 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 01:35:03,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:04,038 INFO L388 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 [2021-12-18 01:35:04,047 INFO L388 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 [2021-12-18 01:35:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-18 01:35:04,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:35:04,149 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:04,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052025578] [2021-12-18 01:35:04,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052025578] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:35:04,149 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:35:04,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 01:35:04,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996909737] [2021-12-18 01:35:04,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:35:04,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:35:04,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:04,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:35:04,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:35:04,150 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) [2021-12-18 01:35:05,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:07,388 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 [] [2021-12-18 01:35:09,432 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 [] [2021-12-18 01:35:11,451 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 [] [2021-12-18 01:35:13,493 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 [] [2021-12-18 01:35:15,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:17,556 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 [] [2021-12-18 01:35:19,567 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 [] [2021-12-18 01:35:22,048 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 [] [2021-12-18 01:35:24,068 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 [] [2021-12-18 01:35:26,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:29,702 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 [] [2021-12-18 01:35:32,145 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 [] [2021-12-18 01:35:33,188 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:35,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:37,379 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 [] [2021-12-18 01:35:39,433 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 [] [2021-12-18 01:35:41,360 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:43,432 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 [] [2021-12-18 01:35:45,442 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 [] [2021-12-18 01:35:46,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:35:46,029 INFO L93 Difference]: Finished difference Result 1399 states and 1888 transitions. [2021-12-18 01:35:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:35:46,032 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 [2021-12-18 01:35:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:35:46,038 INFO L225 Difference]: With dead ends: 1399 [2021-12-18 01:35:46,039 INFO L226 Difference]: Without dead ends: 1339 [2021-12-18 01:35:46,039 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:35:46,040 INFO L933 BasicCegarLoop]: 687 mSDtfsCounter, 4 mSDsluCounter, 3232 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.7s IncrementalHoareTripleChecker+Time [2021-12-18 01:35:46,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3919 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 15 Unknown, 0 Unchecked, 41.7s Time] [2021-12-18 01:35:46,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2021-12-18 01:35:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2021-12-18 01:35:46,075 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) [2021-12-18 01:35:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1806 transitions. [2021-12-18 01:35:46,078 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1806 transitions. Word has length 146 [2021-12-18 01:35:46,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:35:46,079 INFO L470 AbstractCegarLoop]: Abstraction has 1337 states and 1806 transitions. [2021-12-18 01:35:46,079 INFO L471 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) [2021-12-18 01:35:46,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1806 transitions. [2021-12-18 01:35:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-18 01:35:46,080 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:35:46,081 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:35:46,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-12-18 01:35:46,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:35:46,302 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:35:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:35:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash -480950281, now seen corresponding path program 1 times [2021-12-18 01:35:46,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:35:46,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1369784110] [2021-12-18 01:35:46,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:35:46,303 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:35:46,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:35:46,304 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) [2021-12-18 01:35:46,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 01:35:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:35:49,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-18 01:35:49,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:35:49,456 INFO L388 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 [2021-12-18 01:35:49,473 INFO L388 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 [2021-12-18 01:35:49,894 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:35:49,894 INFO L388 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 [2021-12-18 01:35:49,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:35:49,908 INFO L388 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 [2021-12-18 01:35:50,220 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:35:50,220 INFO L388 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 [2021-12-18 01:35:50,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:35:50,237 INFO L388 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 [2021-12-18 01:35:50,492 INFO L388 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 24 treesize of output 20 [2021-12-18 01:35:50,506 INFO L388 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 24 treesize of output 20 [2021-12-18 01:35:50,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:35:50,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 01:35:50,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 36 treesize of output 28 [2021-12-18 01:35:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-12-18 01:35:50,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:35:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-12-18 01:35:51,085 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:35:51,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1369784110] [2021-12-18 01:35:51,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1369784110] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:35:51,085 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:35:51,085 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2021-12-18 01:35:51,085 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257841406] [2021-12-18 01:35:51,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:35:51,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:35:51,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:35:51,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:35:51,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:35:51,086 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) [2021-12-18 01:35:52,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:35:54,682 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 [] [2021-12-18 01:35:56,723 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 [] [2021-12-18 01:35:58,779 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 [] [2021-12-18 01:36:00,925 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 [] [2021-12-18 01:36:03,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:36:05,504 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:36:07,721 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 [] [2021-12-18 01:36:09,756 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 [] [2021-12-18 01:36:11,800 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 [] [2021-12-18 01:36:12,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:36:12,148 INFO L93 Difference]: Finished difference Result 2386 states and 3197 transitions. [2021-12-18 01:36:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:36:12,152 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 [2021-12-18 01:36:12,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:36:12,156 INFO L225 Difference]: With dead ends: 2386 [2021-12-18 01:36:12,156 INFO L226 Difference]: Without dead ends: 1008 [2021-12-18 01:36:12,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 279 SyntacticMatches, 8 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:36:12,160 INFO L933 BasicCegarLoop]: 702 mSDtfsCounter, 2 mSDsluCounter, 3303 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4005 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2021-12-18 01:36:12,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4005 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 7 Unknown, 101 Unchecked, 20.9s Time] [2021-12-18 01:36:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2021-12-18 01:36:12,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 1008. [2021-12-18 01:36:12,199 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) [2021-12-18 01:36:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1336 transitions. [2021-12-18 01:36:12,201 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1336 transitions. Word has length 147 [2021-12-18 01:36:12,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:36:12,202 INFO L470 AbstractCegarLoop]: Abstraction has 1008 states and 1336 transitions. [2021-12-18 01:36:12,203 INFO L471 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) [2021-12-18 01:36:12,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1336 transitions. [2021-12-18 01:36:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-18 01:36:12,204 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:36:12,205 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:36:12,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 01:36:12,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:12,423 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:36:12,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:36:12,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1300549654, now seen corresponding path program 1 times [2021-12-18 01:36:12,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:36:12,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947287499] [2021-12-18 01:36:12,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:36:12,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:36:12,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:36:12,426 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) [2021-12-18 01:36:12,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 01:36:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:36:13,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 1136 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 01:36:13,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:36:13,569 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-18 01:36:13,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:36:13,569 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:36:13,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947287499] [2021-12-18 01:36:13,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947287499] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:36:13,570 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:36:13,570 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 01:36:13,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686132115] [2021-12-18 01:36:13,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:36:13,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:36:13,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:36:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:36:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:36:13,571 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) [2021-12-18 01:36:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:36:13,644 INFO L93 Difference]: Finished difference Result 1696 states and 2271 transitions. [2021-12-18 01:36:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:36:13,645 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 [2021-12-18 01:36:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:36:13,650 INFO L225 Difference]: With dead ends: 1696 [2021-12-18 01:36:13,650 INFO L226 Difference]: Without dead ends: 1011 [2021-12-18 01:36:13,653 INFO L932 BasicCegarLoop]: 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 [2021-12-18 01:36:13,654 INFO L933 BasicCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:36:13,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4129 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 01:36:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2021-12-18 01:36:13,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2021-12-18 01:36:13,680 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) [2021-12-18 01:36:13,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1338 transitions. [2021-12-18 01:36:13,684 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1338 transitions. Word has length 147 [2021-12-18 01:36:13,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:36:13,685 INFO L470 AbstractCegarLoop]: Abstraction has 1011 states and 1338 transitions. [2021-12-18 01:36:13,685 INFO L471 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) [2021-12-18 01:36:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1338 transitions. [2021-12-18 01:36:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2021-12-18 01:36:13,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:36:13,688 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:36:13,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2021-12-18 01:36:13,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:36:13,912 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:36:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:36:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash 345028375, now seen corresponding path program 2 times [2021-12-18 01:36:13,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:36:13,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363530854] [2021-12-18 01:36:13,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:36:13,914 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:36:13,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:36:13,915 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) [2021-12-18 01:36:13,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 01:36:21,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 01:36:21,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:36:21,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 1142 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 01:36:21,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:36:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-18 01:36:22,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:36:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-18 01:36:22,953 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:36:22,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363530854] [2021-12-18 01:36:22,953 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363530854] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:36:22,953 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:36:22,953 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2021-12-18 01:36:22,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951514555] [2021-12-18 01:36:22,953 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:36:22,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 01:36:22,954 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:36:22,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 01:36:22,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-18 01:36:22,954 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) [2021-12-18 01:36:25,377 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 [] [2021-12-18 01:36:27,445 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 [] [2021-12-18 01:36:29,686 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 [] [2021-12-18 01:36:33,217 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:36:36,192 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 [] [2021-12-18 01:36:38,296 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 [] [2021-12-18 01:36:40,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:36:42,464 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 [] [2021-12-18 01:36:44,479 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 [] [2021-12-18 01:36:46,502 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 [] [2021-12-18 01:36:50,733 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 [] [2021-12-18 01:36:52,747 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 [] [2021-12-18 01:36:54,762 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 [] [2021-12-18 01:36:56,940 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 [] [2021-12-18 01:36:58,959 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 [] [2021-12-18 01:37:00,971 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 [] [2021-12-18 01:37:04,745 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 [] [2021-12-18 01:37:06,763 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 [] [2021-12-18 01:37:08,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 [] [2021-12-18 01:37:10,829 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 [] [2021-12-18 01:37:12,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:37:14,858 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 [] [2021-12-18 01:37:17,195 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 [] [2021-12-18 01:37:19,209 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 [] [2021-12-18 01:37:21,263 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 [] [2021-12-18 01:37:23,279 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 [] [2021-12-18 01:37:25,871 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 [] [2021-12-18 01:37:27,897 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 [] [2021-12-18 01:37:29,910 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 [] [2021-12-18 01:37:33,153 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 [] [2021-12-18 01:37:35,169 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 [] [2021-12-18 01:37:37,176 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 [] [2021-12-18 01:37:39,306 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 [] [2021-12-18 01:37:45,875 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 [] [2021-12-18 01:37:47,870 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:37:49,891 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 [] [2021-12-18 01:37:53,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:37:55,510 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 [] [2021-12-18 01:37:57,516 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 [] [2021-12-18 01:37:59,698 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:38:02,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:38:04,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:38:06,418 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 [] [2021-12-18 01:38:07,714 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:38:10,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:38:13,351 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 [] [2021-12-18 01:38:16,144 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 [] [2021-12-18 01:38:18,164 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 [] [2021-12-18 01:38:20,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 [] [2021-12-18 01:38:22,828 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 [] [2021-12-18 01:38:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:38:24,834 INFO L93 Difference]: Finished difference Result 4438 states and 5973 transitions. [2021-12-18 01:38:24,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 01:38:24,835 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 147 [2021-12-18 01:38:24,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:38:24,861 INFO L225 Difference]: With dead ends: 4438 [2021-12-18 01:38:24,861 INFO L226 Difference]: Without dead ends: 3716 [2021-12-18 01:38:24,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2021-12-18 01:38:24,864 INFO L933 BasicCegarLoop]: 2177 mSDtfsCounter, 4409 mSDsluCounter, 4026 mSDsCounter, 0 mSdLazyCounter, 5205 mSolverCounterSat, 2462 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 6203 SdHoareTripleChecker+Invalid, 7709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2462 IncrementalHoareTripleChecker+Valid, 5205 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 121.2s IncrementalHoareTripleChecker+Time [2021-12-18 01:38:24,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4687 Valid, 6203 Invalid, 7709 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2462 Valid, 5205 Invalid, 42 Unknown, 0 Unchecked, 121.2s Time] [2021-12-18 01:38:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3716 states. [2021-12-18 01:38:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3716 to 3300. [2021-12-18 01:38:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3300 states, 2339 states have (on average 1.2278751603249252) internal successors, (2872), 2393 states have internal predecessors, (2872), 762 states have call successors, (762), 189 states have call predecessors, (762), 198 states have return successors, (849), 750 states have call predecessors, (849), 758 states have call successors, (849) [2021-12-18 01:38:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4483 transitions. [2021-12-18 01:38:25,023 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4483 transitions. Word has length 147 [2021-12-18 01:38:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:38:25,023 INFO L470 AbstractCegarLoop]: Abstraction has 3300 states and 4483 transitions. [2021-12-18 01:38:25,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2021-12-18 01:38:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4483 transitions. [2021-12-18 01:38:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-18 01:38:25,027 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:38:25,027 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2021-12-18 01:38:25,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 01:38:25,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:38:25,255 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:38:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:38:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1296056406, now seen corresponding path program 1 times [2021-12-18 01:38:25,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:38:25,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484796418] [2021-12-18 01:38:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:38:25,256 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:38:25,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:38:25,258 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:38:25,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 01:38:26,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:38:26,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 01:38:26,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:38:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2021-12-18 01:38:26,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:38:26,455 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:38:26,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484796418] [2021-12-18 01:38:26,455 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484796418] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:38:26,455 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:38:26,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-18 01:38:26,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788537583] [2021-12-18 01:38:26,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:38:26,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:38:26,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:38:26,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:38:26,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:38:26,457 INFO L87 Difference]: Start difference. First operand 3300 states and 4483 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 01:38:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:38:26,699 INFO L93 Difference]: Finished difference Result 6587 states and 8964 transitions. [2021-12-18 01:38:26,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 01:38:26,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) Word has length 157 [2021-12-18 01:38:26,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:38:26,714 INFO L225 Difference]: With dead ends: 6587 [2021-12-18 01:38:26,727 INFO L226 Difference]: Without dead ends: 3300 [2021-12-18 01:38:26,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:38:26,760 INFO L933 BasicCegarLoop]: 691 mSDtfsCounter, 2 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:38:26,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 4142 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 01:38:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2021-12-18 01:38:26,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 3296. [2021-12-18 01:38:26,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 2335 states have (on average 1.2265524625267665) internal successors, (2864), 2391 states have internal predecessors, (2864), 762 states have call successors, (762), 189 states have call predecessors, (762), 198 states have return successors, (849), 748 states have call predecessors, (849), 758 states have call successors, (849) [2021-12-18 01:38:26,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 4475 transitions. [2021-12-18 01:38:26,997 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 4475 transitions. Word has length 157 [2021-12-18 01:38:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:38:26,997 INFO L470 AbstractCegarLoop]: Abstraction has 3296 states and 4475 transitions. [2021-12-18 01:38:26,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (18), 4 states have call predecessors, (18), 2 states have call successors, (18) [2021-12-18 01:38:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 4475 transitions. [2021-12-18 01:38:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-12-18 01:38:26,999 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:38:26,999 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:38:27,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 01:38:27,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:38:27,200 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:38:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:38:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -981047690, now seen corresponding path program 2 times [2021-12-18 01:38:27,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:38:27,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657289628] [2021-12-18 01:38:27,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:38:27,201 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:38:27,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:38:27,202 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:38:27,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 01:38:34,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 01:38:34,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:38:34,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 01:38:34,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:38:35,277 INFO L388 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 [2021-12-18 01:38:35,283 INFO L388 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 [2021-12-18 01:38:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-18 01:38:35,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:38:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2021-12-18 01:38:35,934 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:38:35,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [657289628] [2021-12-18 01:38:35,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [657289628] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 01:38:35,934 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:38:35,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 9 [2021-12-18 01:38:35,935 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467325151] [2021-12-18 01:38:35,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:38:35,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:38:35,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:38:35,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:38:35,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:38:35,936 INFO L87 Difference]: Start difference. First operand 3296 states and 4475 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) [2021-12-18 01:38:37,806 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:38:39,833 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 [] [2021-12-18 01:38:41,899 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 [] [2021-12-18 01:38:43,919 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 [] [2021-12-18 01:38:45,989 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 [] [2021-12-18 01:38:48,006 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 [] [2021-12-18 01:38:50,078 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 [] [2021-12-18 01:38:52,093 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 [] [2021-12-18 01:38:54,330 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 [] [2021-12-18 01:38:56,353 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 [] [2021-12-18 01:39:00,287 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 [] [2021-12-18 01:39:02,308 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 [] [2021-12-18 01:39:04,823 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 [] [2021-12-18 01:39:06,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:39:08,146 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 [] [2021-12-18 01:39:09,612 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:39:11,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 [] [2021-12-18 01:39:13,693 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 [] [2021-12-18 01:39:15,440 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:39:17,468 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 [] [2021-12-18 01:39:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:39:18,135 INFO L93 Difference]: Finished difference Result 3447 states and 4663 transitions. [2021-12-18 01:39:18,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:39:18,139 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 [2021-12-18 01:39:18,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:39:18,163 INFO L225 Difference]: With dead ends: 3447 [2021-12-18 01:39:18,163 INFO L226 Difference]: Without dead ends: 3298 [2021-12-18 01:39:18,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 303 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-18 01:39:18,166 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 5 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 5 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.0s IncrementalHoareTripleChecker+Time [2021-12-18 01:39:18,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 3919 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 213 Invalid, 16 Unknown, 0 Unchecked, 42.0s Time] [2021-12-18 01:39:18,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2021-12-18 01:39:18,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3298. [2021-12-18 01:39:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3298 states, 2336 states have (on average 1.2251712328767124) internal successors, (2862), 2393 states have internal predecessors, (2862), 763 states have call successors, (763), 189 states have call predecessors, (763), 198 states have return successors, (849), 748 states have call predecessors, (849), 758 states have call successors, (849) [2021-12-18 01:39:18,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3298 states to 3298 states and 4474 transitions. [2021-12-18 01:39:18,354 INFO L78 Accepts]: Start accepts. Automaton has 3298 states and 4474 transitions. Word has length 157 [2021-12-18 01:39:18,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:39:18,354 INFO L470 AbstractCegarLoop]: Abstraction has 3298 states and 4474 transitions. [2021-12-18 01:39:18,354 INFO L471 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) [2021-12-18 01:39:18,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3298 states and 4474 transitions. [2021-12-18 01:39:18,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-18 01:39:18,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:39:18,356 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 01:39:18,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 01:39:18,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:39:18,597 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:39:18,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:39:18,598 INFO L85 PathProgramCache]: Analyzing trace with hash -181427629, now seen corresponding path program 1 times [2021-12-18 01:39:18,599 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:39:18,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711150941] [2021-12-18 01:39:18,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:39:18,600 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:39:18,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:39:18,601 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:39:18,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 01:39:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:39:19,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 01:39:19,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:39:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2021-12-18 01:39:20,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:39:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2021-12-18 01:39:21,827 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:39:21,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711150941] [2021-12-18 01:39:21,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711150941] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:39:21,827 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:39:21,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2021-12-18 01:39:21,827 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295097927] [2021-12-18 01:39:21,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:39:21,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-18 01:39:21,828 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:39:21,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-18 01:39:21,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-12-18 01:39:21,828 INFO L87 Difference]: Start difference. First operand 3298 states and 4474 transitions. Second operand has 17 states, 17 states have (on average 10.0) internal successors, (170), 17 states have internal predecessors, (170), 12 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2021-12-18 01:39:25,054 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 [] [2021-12-18 01:39:27,067 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 [] [2021-12-18 01:39:29,083 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 [] [2021-12-18 01:39:31,097 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 [] [2021-12-18 01:39:33,112 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 [] [2021-12-18 01:39:35,123 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 [] [2021-12-18 01:39:37,366 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 [] [2021-12-18 01:39:39,376 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 [] [2021-12-18 01:39:41,397 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 [] [2021-12-18 01:39:43,419 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 [] [2021-12-18 01:39:45,433 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 [] [2021-12-18 01:39:47,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 [] [2021-12-18 01:39:50,680 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 [] [2021-12-18 01:39:52,691 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 [] [2021-12-18 01:39:54,705 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 [] [2021-12-18 01:39:56,715 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 [] [2021-12-18 01:39:58,731 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 [] [2021-12-18 01:40:00,749 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 [] [2021-12-18 01:40:04,587 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 [] [2021-12-18 01:40:06,622 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 [] [2021-12-18 01:40:08,643 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 [] [2021-12-18 01:40:10,663 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 [] [2021-12-18 01:40:12,683 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 [] [2021-12-18 01:40:14,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 [] [2021-12-18 01:40:18,721 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 [] [2021-12-18 01:40:21,040 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 [] [2021-12-18 01:40:23,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:40:25,642 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 [] [2021-12-18 01:40:29,867 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 [] [2021-12-18 01:40:31,616 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 [] [2021-12-18 01:40:33,129 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 [] [2021-12-18 01:40:35,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:40:36,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:40:37,908 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:40:40,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:40:41,543 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:40:43,563 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 [] [2021-12-18 01:40:45,580 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 [] [2021-12-18 01:40:48,340 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 [] [2021-12-18 01:40:49,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:40:51,878 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 [] [2021-12-18 01:40:53,116 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:40:55,036 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 [] [2021-12-18 01:40:59,515 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 [] [2021-12-18 01:41:01,528 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 [] [2021-12-18 01:41:03,545 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 [] [2021-12-18 01:41:05,562 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 [] [2021-12-18 01:41:07,739 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 [] [2021-12-18 01:41:09,754 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 [] [2021-12-18 01:41:11,766 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 [] [2021-12-18 01:41:13,787 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 [] [2021-12-18 01:41:16,368 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 [] [2021-12-18 01:41:18,402 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 [] [2021-12-18 01:41:20,413 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 [] [2021-12-18 01:41:22,425 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 [] [2021-12-18 01:41:24,968 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 [] [2021-12-18 01:41:26,985 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 [] [2021-12-18 01:41:28,996 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 [] [2021-12-18 01:41:31,006 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 [] [2021-12-18 01:41:35,033 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 [] [2021-12-18 01:41:37,044 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 [] [2021-12-18 01:41:39,058 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 [] [2021-12-18 01:41:41,211 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 [] [2021-12-18 01:41:43,226 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 [] [2021-12-18 01:41:45,238 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 [] [2021-12-18 01:41:47,991 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 [] [2021-12-18 01:41:50,015 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 [] [2021-12-18 01:41:52,029 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 [] [2021-12-18 01:41:54,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 [] [2021-12-18 01:41:56,915 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 [] [2021-12-18 01:41:58,930 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 [] [2021-12-18 01:42:00,962 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 [] [2021-12-18 01:42:02,269 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:42:05,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:42:07,439 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 [] [2021-12-18 01:42:09,800 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:42:12,982 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 [] [2021-12-18 01:42:15,000 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 [] [2021-12-18 01:42:17,021 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 [] [2021-12-18 01:42:19,046 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 [] [2021-12-18 01:42:21,238 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 [] [2021-12-18 01:42:23,259 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 [] [2021-12-18 01:42:25,280 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 [] [2021-12-18 01:42:27,296 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 [] [2021-12-18 01:42:30,289 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 [] [2021-12-18 01:42:32,300 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 [] [2021-12-18 01:42:34,306 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 [] [2021-12-18 01:42:36,325 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 [] [2021-12-18 01:42:40,041 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:42:42,556 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 [] [2021-12-18 01:42:44,112 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:42:46,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:42:48,143 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 [] [2021-12-18 01:42:50,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:42:53,017 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 [] [2021-12-18 01:42:54,808 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:42:57,608 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 [] [2021-12-18 01:42:59,617 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 [] [2021-12-18 01:43:01,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:43:03,598 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 [] [2021-12-18 01:43:07,412 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 [] [2021-12-18 01:43:09,431 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 [] [2021-12-18 01:43:11,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:43:13,979 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 [] [2021-12-18 01:43:16,002 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 [] [2021-12-18 01:43:18,017 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 [] [2021-12-18 01:43:20,040 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 [] [2021-12-18 01:43:22,046 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 [] [2021-12-18 01:43:24,109 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 [] [2021-12-18 01:43:26,123 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 [] [2021-12-18 01:43:28,136 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 [] [2021-12-18 01:43:30,151 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 [] [2021-12-18 01:43:32,166 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 [] [2021-12-18 01:43:34,301 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 [] [2021-12-18 01:43:36,310 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 [] [2021-12-18 01:43:38,320 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 [] [2021-12-18 01:43:40,337 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 [] [2021-12-18 01:43:42,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:43:45,143 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 [] [2021-12-18 01:43:47,162 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 [] [2021-12-18 01:43:49,177 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 [] [2021-12-18 01:43:51,193 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 [] [2021-12-18 01:43:53,204 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 [] [2021-12-18 01:43:55,214 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 [] [2021-12-18 01:43:58,159 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 [] [2021-12-18 01:44:00,182 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 [] [2021-12-18 01:44:04,513 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 [] [2021-12-18 01:44:06,525 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 [] [2021-12-18 01:44:08,550 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 [] [2021-12-18 01:44:10,567 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 [] [2021-12-18 01:44:12,578 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 [] [2021-12-18 01:44:13,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:44:16,523 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 [] [2021-12-18 01:44:18,537 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 [] [2021-12-18 01:44:20,557 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 [] [2021-12-18 01:44:22,569 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 [] [2021-12-18 01:44:24,577 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 [] [2021-12-18 01:44:26,596 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 [] [2021-12-18 01:44:28,258 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:44:30,786 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 [] [2021-12-18 01:44:32,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:44:37,177 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 [] [2021-12-18 01:44:39,188 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 [] [2021-12-18 01:44:41,206 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 [] [2021-12-18 01:44:43,227 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 [] [2021-12-18 01:44:45,240 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 [] [2021-12-18 01:44:47,250 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 [] [2021-12-18 01:44:51,184 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 [] [2021-12-18 01:44:53,199 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 [] [2021-12-18 01:44:55,213 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 [] [2021-12-18 01:44:57,228 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 [] [2021-12-18 01:44:59,248 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 [] [2021-12-18 01:45:01,470 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 [] [2021-12-18 01:45:03,487 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 [] [2021-12-18 01:45:05,509 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 [] [2021-12-18 01:45:07,524 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 [] [2021-12-18 01:45:09,540 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 [] [2021-12-18 01:45:12,994 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 [] [2021-12-18 01:45:15,013 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 [] [2021-12-18 01:45:17,029 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 [] [2021-12-18 01:45:19,053 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 [] [2021-12-18 01:45:21,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:45:25,365 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 [] [2021-12-18 01:45:31,573 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 [] [2021-12-18 01:45:33,586 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 [] [2021-12-18 01:45:35,595 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 [] [2021-12-18 01:45:37,610 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 [] [2021-12-18 01:45:39,626 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 [] [2021-12-18 01:45:42,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:45:42,863 INFO L93 Difference]: Finished difference Result 11554 states and 15639 transitions. [2021-12-18 01:45:42,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-18 01:45:42,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 10.0) internal successors, (170), 17 states have internal predecessors, (170), 12 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) Word has length 158 [2021-12-18 01:45:42,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:45:42,913 INFO L225 Difference]: With dead ends: 11554 [2021-12-18 01:45:42,913 INFO L226 Difference]: Without dead ends: 9839 [2021-12-18 01:45:42,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=347, Invalid=1213, Unknown=0, NotChecked=0, Total=1560 [2021-12-18 01:45:42,921 INFO L933 BasicCegarLoop]: 2255 mSDtfsCounter, 9007 mSDsluCounter, 9070 mSDsCounter, 0 mSdLazyCounter, 14887 mSolverCounterSat, 4747 mSolverCounterUnsat, 143 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 371.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9450 SdHoareTripleChecker+Valid, 11325 SdHoareTripleChecker+Invalid, 19777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4747 IncrementalHoareTripleChecker+Valid, 14887 IncrementalHoareTripleChecker+Invalid, 143 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 378.9s IncrementalHoareTripleChecker+Time [2021-12-18 01:45:42,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9450 Valid, 11325 Invalid, 19777 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4747 Valid, 14887 Invalid, 143 Unknown, 0 Unchecked, 378.9s Time] [2021-12-18 01:45:42,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9839 states. [2021-12-18 01:45:43,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9839 to 9636. [2021-12-18 01:45:43,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9636 states, 6825 states have (on average 1.227838827838828) internal successors, (8380), 6996 states have internal predecessors, (8380), 2225 states have call successors, (2225), 553 states have call predecessors, (2225), 585 states have return successors, (2490), 2184 states have call predecessors, (2490), 2217 states have call successors, (2490) [2021-12-18 01:45:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9636 states to 9636 states and 13095 transitions. [2021-12-18 01:45:43,501 INFO L78 Accepts]: Start accepts. Automaton has 9636 states and 13095 transitions. Word has length 158 [2021-12-18 01:45:43,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:45:43,502 INFO L470 AbstractCegarLoop]: Abstraction has 9636 states and 13095 transitions. [2021-12-18 01:45:43,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 10.0) internal successors, (170), 17 states have internal predecessors, (170), 12 states have call successors, (32), 9 states have call predecessors, (32), 10 states have return successors, (29), 11 states have call predecessors, (29), 11 states have call successors, (29) [2021-12-18 01:45:43,502 INFO L276 IsEmpty]: Start isEmpty. Operand 9636 states and 13095 transitions. [2021-12-18 01:45:43,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2021-12-18 01:45:43,520 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:45:43,520 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:45:43,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 01:45:43,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:45:43,736 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:45:43,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:45:43,737 INFO L85 PathProgramCache]: Analyzing trace with hash 507809139, now seen corresponding path program 2 times [2021-12-18 01:45:43,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:45:43,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416639801] [2021-12-18 01:45:43,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:45:43,738 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:45:43,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:45:43,741 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:45:43,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 01:45:52,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 01:45:52,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:45:52,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 1160 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-18 01:45:52,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:45:52,367 INFO L388 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 [2021-12-18 01:45:52,386 INFO L388 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 [2021-12-18 01:45:52,889 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:45:52,890 INFO L388 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 [2021-12-18 01:45:52,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:45:52,909 INFO L388 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 [2021-12-18 01:45:53,304 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:45:53,305 INFO L388 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 [2021-12-18 01:45:53,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:45:53,323 INFO L388 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 [2021-12-18 01:45:53,343 INFO L388 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 [2021-12-18 01:45:53,350 INFO L388 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 [2021-12-18 01:45:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 66 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-18 01:45:53,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:45:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2021-12-18 01:45:53,907 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:45:53,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416639801] [2021-12-18 01:45:53,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416639801] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:45:53,907 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:45:53,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2021-12-18 01:45:53,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852215033] [2021-12-18 01:45:53,907 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:45:53,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:45:53,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:45:53,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:45:53,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:45:53,909 INFO L87 Difference]: Start difference. First operand 9636 states and 13095 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 01:45:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:45:54,345 INFO L93 Difference]: Finished difference Result 16456 states and 22180 transitions. [2021-12-18 01:45:54,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:45:54,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 158 [2021-12-18 01:45:54,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:45:54,367 INFO L225 Difference]: With dead ends: 16456 [2021-12-18 01:45:54,367 INFO L226 Difference]: Without dead ends: 6622 [2021-12-18 01:45:54,388 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-12-18 01:45:54,389 INFO L933 BasicCegarLoop]: 702 mSDtfsCounter, 4 mSDsluCounter, 2709 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:45:54,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 3411 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2021-12-18 01:45:54,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6622 states. [2021-12-18 01:45:54,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6622 to 6539. [2021-12-18 01:45:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6539 states, 4624 states have (on average 1.2216695501730104) internal successors, (5649), 4740 states have internal predecessors, (5649), 1472 states have call successors, (1472), 411 states have call predecessors, (1472), 442 states have return successors, (1649), 1453 states have call predecessors, (1649), 1466 states have call successors, (1649) [2021-12-18 01:45:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 8770 transitions. [2021-12-18 01:45:54,616 INFO L78 Accepts]: Start accepts. Automaton has 6539 states and 8770 transitions. Word has length 158 [2021-12-18 01:45:54,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:45:54,617 INFO L470 AbstractCegarLoop]: Abstraction has 6539 states and 8770 transitions. [2021-12-18 01:45:54,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 4 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2021-12-18 01:45:54,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 8770 transitions. [2021-12-18 01:45:54,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2021-12-18 01:45:54,622 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:45:54,623 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:45:54,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2021-12-18 01:45:54,835 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:45:54,835 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:45:54,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:45:54,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1356555760, now seen corresponding path program 1 times [2021-12-18 01:45:54,837 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:45:54,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096797086] [2021-12-18 01:45:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:45:54,837 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:45:54,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:45:54,838 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:45:54,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 01:45:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:45:55,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 1187 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-18 01:45:55,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:45:56,366 INFO L388 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 [2021-12-18 01:45:56,372 INFO L388 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 [2021-12-18 01:45:56,542 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-18 01:45:56,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:45:57,221 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2021-12-18 01:45:57,221 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:45:57,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096797086] [2021-12-18 01:45:57,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096797086] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-18 01:45:57,221 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-18 01:45:57,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2021-12-18 01:45:57,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026969213] [2021-12-18 01:45:57,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:45:57,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:45:57,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:45:57,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:45:57,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:45:57,222 INFO L87 Difference]: Start difference. First operand 6539 states and 8770 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) [2021-12-18 01:45:59,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:46:00,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:46:02,424 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 [] [2021-12-18 01:46:04,444 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 [] [2021-12-18 01:46:06,496 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 [] [2021-12-18 01:46:08,513 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 [] [2021-12-18 01:46:10,589 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 [] [2021-12-18 01:46:12,606 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 [] [2021-12-18 01:46:14,948 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 [] [2021-12-18 01:46:16,955 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 [] [2021-12-18 01:46:19,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:46:20,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:46:22,969 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 [] [2021-12-18 01:46:26,422 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 [] [2021-12-18 01:46:28,438 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 [] [2021-12-18 01:46:30,724 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 [] [2021-12-18 01:46:32,735 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 [] [2021-12-18 01:46:34,810 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 [] [2021-12-18 01:46:36,822 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 [] [2021-12-18 01:46:37,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:46:37,651 INFO L93 Difference]: Finished difference Result 6803 states and 9105 transitions. [2021-12-18 01:46:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 01:46:37,655 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 [2021-12-18 01:46:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:46:37,671 INFO L225 Difference]: With dead ends: 6803 [2021-12-18 01:46:37,672 INFO L226 Difference]: Without dead ends: 6549 [2021-12-18 01:46:37,674 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 320 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2021-12-18 01:46:37,675 INFO L933 BasicCegarLoop]: 688 mSDtfsCounter, 6 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 6 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3917 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.1s IncrementalHoareTripleChecker+Time [2021-12-18 01:46:37,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 3917 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 220 Invalid, 15 Unknown, 0 Unchecked, 40.1s Time] [2021-12-18 01:46:37,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6549 states. [2021-12-18 01:46:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6549 to 6549. [2021-12-18 01:46:37,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6549 states, 4629 states have (on average 1.220349967595593) internal successors, (5649), 4747 states have internal predecessors, (5649), 1477 states have call successors, (1477), 411 states have call predecessors, (1477), 442 states have return successors, (1652), 1456 states have call predecessors, (1652), 1468 states have call successors, (1652) [2021-12-18 01:46:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6549 states to 6549 states and 8778 transitions. [2021-12-18 01:46:37,869 INFO L78 Accepts]: Start accepts. Automaton has 6549 states and 8778 transitions. Word has length 168 [2021-12-18 01:46:37,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:46:37,870 INFO L470 AbstractCegarLoop]: Abstraction has 6549 states and 8778 transitions. [2021-12-18 01:46:37,870 INFO L471 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) [2021-12-18 01:46:37,870 INFO L276 IsEmpty]: Start isEmpty. Operand 6549 states and 8778 transitions. [2021-12-18 01:46:37,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-12-18 01:46:37,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:46:37,872 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:46:37,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2021-12-18 01:46:38,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:46:38,095 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:46:38,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:46:38,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1337211022, now seen corresponding path program 1 times [2021-12-18 01:46:38,097 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:46:38,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024171332] [2021-12-18 01:46:38,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 01:46:38,097 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:46:38,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:46:38,104 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:46:38,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 01:46:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 01:46:38,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 01:46:38,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:46:39,427 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2021-12-18 01:46:39,525 INFO L388 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 20 treesize of output 8 [2021-12-18 01:46:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2021-12-18 01:46:39,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 01:46:39,678 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:46:39,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024171332] [2021-12-18 01:46:39,678 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024171332] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 01:46:39,679 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 01:46:39,679 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-18 01:46:39,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494375993] [2021-12-18 01:46:39,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 01:46:39,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 01:46:39,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:46:39,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 01:46:39,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-12-18 01:46:39,680 INFO L87 Difference]: Start difference. First operand 6549 states and 8778 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 5 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 01:46:41,871 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 [] [2021-12-18 01:46:43,949 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 [] [2021-12-18 01:46:46,019 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 [] [2021-12-18 01:46:48,076 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 [] [2021-12-18 01:46:50,318 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 [] [2021-12-18 01:46:53,868 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 [] [2021-12-18 01:46:55,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:47:00,340 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 [] [2021-12-18 01:47:02,360 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 [] [2021-12-18 01:47:04,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:47:06,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:47:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 01:47:06,863 INFO L93 Difference]: Finished difference Result 6791 states and 9103 transitions. [2021-12-18 01:47:06,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 01:47:06,867 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 5 states have call predecessors, (17), 2 states have call successors, (17) Word has length 169 [2021-12-18 01:47:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 01:47:06,915 INFO L225 Difference]: With dead ends: 6791 [2021-12-18 01:47:06,915 INFO L226 Difference]: Without dead ends: 6634 [2021-12-18 01:47:06,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-12-18 01:47:06,922 INFO L933 BasicCegarLoop]: 704 mSDtfsCounter, 15 mSDsluCounter, 6216 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 6920 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2021-12-18 01:47:06,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 6920 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 9 Unknown, 0 Unchecked, 26.9s Time] [2021-12-18 01:47:06,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6634 states. [2021-12-18 01:47:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6634 to 6574. [2021-12-18 01:47:07,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6574 states, 4654 states have (on average 1.2200257842715942) internal successors, (5678), 4767 states have internal predecessors, (5678), 1477 states have call successors, (1477), 411 states have call predecessors, (1477), 442 states have return successors, (1652), 1461 states have call predecessors, (1652), 1468 states have call successors, (1652) [2021-12-18 01:47:07,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6574 states to 6574 states and 8807 transitions. [2021-12-18 01:47:07,200 INFO L78 Accepts]: Start accepts. Automaton has 6574 states and 8807 transitions. Word has length 169 [2021-12-18 01:47:07,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 01:47:07,200 INFO L470 AbstractCegarLoop]: Abstraction has 6574 states and 8807 transitions. [2021-12-18 01:47:07,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 2 states have call successors, (17), 2 states have call predecessors, (17), 5 states have return successors, (17), 5 states have call predecessors, (17), 2 states have call successors, (17) [2021-12-18 01:47:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states and 8807 transitions. [2021-12-18 01:47:07,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-12-18 01:47:07,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 01:47:07,203 INFO L514 BasicCegarLoop]: 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] [2021-12-18 01:47:07,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 01:47:07,423 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 01:47:07,424 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-18 01:47:07,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 01:47:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2032139182, now seen corresponding path program 2 times [2021-12-18 01:47:07,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 01:47:07,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352062924] [2021-12-18 01:47:07,425 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 01:47:07,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 01:47:07,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 01:47:07,440 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 01:47:07,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 01:47:16,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 01:47:16,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 01:47:16,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 01:47:16,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 01:47:17,002 INFO L388 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 [2021-12-18 01:47:17,017 INFO L388 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 [2021-12-18 01:47:17,481 INFO L354 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2021-12-18 01:47:17,482 INFO L388 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 [2021-12-18 01:47:17,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 01:47:17,514 INFO L388 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 [2021-12-18 01:47:17,545 INFO L388 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 [2021-12-18 01:47:17,549 INFO L388 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 [2021-12-18 01:47:17,648 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 51 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2021-12-18 01:47:17,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 01:47:17,998 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2021-12-18 01:47:17,998 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 01:47:17,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352062924] [2021-12-18 01:47:17,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352062924] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 01:47:17,998 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 01:47:17,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 7 [2021-12-18 01:47:18,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289667667] [2021-12-18 01:47:18,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 01:47:18,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-18 01:47:18,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 01:47:18,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-18 01:47:18,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-18 01:47:18,002 INFO L87 Difference]: Start difference. First operand 6574 states and 8807 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 6 states have internal predecessors, (98), 4 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (20), 5 states have call predecessors, (20), 4 states have call successors, (20) [2021-12-18 01:47:19,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-18 01:47:21,276 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 [] Killed by 15