./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.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 1bad5b7f91b61cdf9d4f1ace01330b8d7c80f8ede0ca40c43d18f706f54101eb --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:45:17,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:45:17,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:45:17,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:45:17,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:45:17,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:45:17,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:45:17,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:45:17,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:45:17,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:45:17,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:45:17,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:45:17,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:45:17,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:45:17,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:45:17,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:45:17,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:45:17,244 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:45:17,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:45:17,249 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:45:17,250 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:45:17,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:45:17,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:45:17,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:45:17,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:45:17,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:45:17,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:45:17,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:45:17,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:45:17,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:45:17,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:45:17,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:45:17,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:45:17,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:45:17,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:45:17,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:45:17,277 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:45:17,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:45:17,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:45:17,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:45:17,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:45:17,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:45:17,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 00:45:17,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:45:17,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:45:17,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:45:17,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:45:17,307 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:45:17,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:45:17,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:45:17,308 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:45:17,308 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:45:17,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:45:17,309 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 00:45:17,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:45:17,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:45:17,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:45:17,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:45:17,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:45:17,309 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:45:17,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:45:17,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:45:17,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:45:17,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:45:17,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:45:17,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:45:17,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:45:17,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:45:17,312 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 00:45:17,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 00:45:17,312 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:45:17,312 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:45:17,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:45:17,312 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 -> 1bad5b7f91b61cdf9d4f1ace01330b8d7c80f8ede0ca40c43d18f706f54101eb [2022-07-14 00:45:17,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:45:17,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:45:17,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:45:17,511 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:45:17,523 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:45:17,524 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:45:17,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e951769/a6ab75f46fd74e54ad4a1740d855ce74/FLAGd08d1f43e [2022-07-14 00:45:18,101 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:45:18,102 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:45:18,136 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e951769/a6ab75f46fd74e54ad4a1740d855ce74/FLAGd08d1f43e [2022-07-14 00:45:18,544 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e951769/a6ab75f46fd74e54ad4a1740d855ce74 [2022-07-14 00:45:18,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:45:18,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:45:18,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:45:18,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:45:18,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:45:18,552 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:45:18" (1/1) ... [2022-07-14 00:45:18,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eeaa6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:18, skipping insertion in model container [2022-07-14 00:45:18,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:45:18" (1/1) ... [2022-07-14 00:45:18,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:45:18,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:45:19,318 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-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i[144238,144251] [2022-07-14 00:45:19,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:45:19,349 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:45:19,526 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-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i[144238,144251] [2022-07-14 00:45:19,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:45:19,561 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:45:19,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19 WrapperNode [2022-07-14 00:45:19,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:45:19,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:45:19,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:45:19,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:45:19,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,606 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,672 INFO L137 Inliner]: procedures = 115, calls = 787, calls flagged for inlining = 53, calls inlined = 52, statements flattened = 1938 [2022-07-14 00:45:19,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:45:19,673 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:45:19,673 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:45:19,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:45:19,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,787 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:45:19,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:45:19,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:45:19,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:45:19,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (1/1) ... [2022-07-14 00:45:19,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:45:19,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:45:19,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 00:45:19,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 00:45:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 00:45:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-14 00:45:19,867 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-14 00:45:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:45:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:45:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:45:19,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:45:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 00:45:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 00:45:19,868 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 00:45:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-07-14 00:45:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-07-14 00:45:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:45:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:45:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 00:45:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 00:45:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:45:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:45:19,869 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 00:45:19,869 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 00:45:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:45:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:45:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_serial_port_data [2022-07-14 00:45:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_serial_port_data [2022-07-14 00:45:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 00:45:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_tty [2022-07-14 00:45:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_tty [2022-07-14 00:45:19,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-14 00:45:19,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-14 00:45:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:45:19,871 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:45:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_detach_1 [2022-07-14 00:45:19,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_detach_1 [2022-07-14 00:45:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:45:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-14 00:45:19,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-14 00:45:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:45:19,871 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_tiocmset [2022-07-14 00:45:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_tiocmset [2022-07-14 00:45:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_tiocmget [2022-07-14 00:45:19,872 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_tiocmget [2022-07-14 00:45:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:45:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:45:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:45:19,872 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_ioctl [2022-07-14 00:45:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_ioctl [2022-07-14 00:45:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-14 00:45:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-14 00:45:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-14 00:45:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-14 00:45:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_write_room [2022-07-14 00:45:19,873 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_write_room [2022-07-14 00:45:19,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:45:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:45:19,874 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_init_termios [2022-07-14 00:45:19,874 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_init_termios [2022-07-14 00:45:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2022-07-14 00:45:19,875 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2022-07-14 00:45:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 00:45:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 00:45:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 00:45:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 00:45:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 00:45:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_set_termios [2022-07-14 00:45:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_set_termios [2022-07-14 00:45:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 00:45:19,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:45:19,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:45:20,200 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:45:20,202 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:45:20,463 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:45:22,721 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:45:22,728 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:45:22,728 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:45:22,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:45:22 BoogieIcfgContainer [2022-07-14 00:45:22,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:45:22,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:45:22,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:45:22,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:45:22,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:45:18" (1/3) ... [2022-07-14 00:45:22,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c530d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:45:22, skipping insertion in model container [2022-07-14 00:45:22,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:45:19" (2/3) ... [2022-07-14 00:45:22,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c530d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:45:22, skipping insertion in model container [2022-07-14 00:45:22,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:45:22" (3/3) ... [2022-07-14 00:45:22,735 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:45:22,744 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:45:22,744 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:45:22,778 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:45:22,782 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70188d11, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c17cff [2022-07-14 00:45:22,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:45:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 599 states, 458 states have (on average 1.425764192139738) internal successors, (653), 465 states have internal predecessors, (653), 114 states have call successors, (114), 26 states have call predecessors, (114), 25 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2022-07-14 00:45:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 00:45:22,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:22,798 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:45:22,799 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:22,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:22,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1644840656, now seen corresponding path program 1 times [2022-07-14 00:45:22,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:22,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988759443] [2022-07-14 00:45:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:23,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:45:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:45:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:45:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:45:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:45:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:45:23,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:45:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:45:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:45:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-14 00:45:23,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:23,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988759443] [2022-07-14 00:45:23,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988759443] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:23,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:23,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 00:45:23,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321627770] [2022-07-14 00:45:23,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:23,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 00:45:23,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:23,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 00:45:23,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-14 00:45:23,441 INFO L87 Difference]: Start difference. First operand has 599 states, 458 states have (on average 1.425764192139738) internal successors, (653), 465 states have internal predecessors, (653), 114 states have call successors, (114), 26 states have call predecessors, (114), 25 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:45:25,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:26,730 INFO L93 Difference]: Finished difference Result 1321 states and 2037 transitions. [2022-07-14 00:45:26,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:45:26,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2022-07-14 00:45:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:26,745 INFO L225 Difference]: With dead ends: 1321 [2022-07-14 00:45:26,745 INFO L226 Difference]: Without dead ends: 710 [2022-07-14 00:45:26,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:26,753 INFO L413 NwaCegarLoop]: 869 mSDtfsCounter, 550 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 333 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:26,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 2213 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 740 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 00:45:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-07-14 00:45:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 583. [2022-07-14 00:45:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 449 states have (on average 1.3875278396436526) internal successors, (623), 450 states have internal predecessors, (623), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2022-07-14 00:45:26,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 839 transitions. [2022-07-14 00:45:26,820 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 839 transitions. Word has length 128 [2022-07-14 00:45:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:26,821 INFO L495 AbstractCegarLoop]: Abstraction has 583 states and 839 transitions. [2022-07-14 00:45:26,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:45:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 839 transitions. [2022-07-14 00:45:26,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 00:45:26,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:26,825 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:45:26,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 00:45:26,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:26,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:26,826 INFO L85 PathProgramCache]: Analyzing trace with hash 674606452, now seen corresponding path program 1 times [2022-07-14 00:45:26,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:26,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365634490] [2022-07-14 00:45:26,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:26,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:26,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:26,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:45:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:45:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:27,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:45:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:45:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:45:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:45:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:45:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:45:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 00:45:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-14 00:45:27,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:27,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365634490] [2022-07-14 00:45:27,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365634490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:27,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:27,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:45:27,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990527319] [2022-07-14 00:45:27,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:27,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:45:27,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:27,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:45:27,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:27,179 INFO L87 Difference]: Start difference. First operand 583 states and 839 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:45:29,798 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:30,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:30,618 INFO L93 Difference]: Finished difference Result 1325 states and 1937 transitions. [2022-07-14 00:45:30,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:45:30,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2022-07-14 00:45:30,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:30,623 INFO L225 Difference]: With dead ends: 1325 [2022-07-14 00:45:30,623 INFO L226 Difference]: Without dead ends: 773 [2022-07-14 00:45:30,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:45:30,626 INFO L413 NwaCegarLoop]: 848 mSDtfsCounter, 843 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 480 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:30,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2173 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 926 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-14 00:45:30,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-07-14 00:45:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 644. [2022-07-14 00:45:30,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 500 states have (on average 1.382) internal successors, (691), 502 states have internal predecessors, (691), 113 states have call successors, (113), 30 states have call predecessors, (113), 30 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2022-07-14 00:45:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 917 transitions. [2022-07-14 00:45:30,662 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 917 transitions. Word has length 128 [2022-07-14 00:45:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:30,663 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 917 transitions. [2022-07-14 00:45:30,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 00:45:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 917 transitions. [2022-07-14 00:45:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-07-14 00:45:30,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:30,665 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:45:30,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 00:45:30,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:30,666 INFO L85 PathProgramCache]: Analyzing trace with hash 877783348, now seen corresponding path program 1 times [2022-07-14 00:45:30,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:30,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290392586] [2022-07-14 00:45:30,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:30,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:30,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:45:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:45:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:45:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:45:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:45:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:45:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:45:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:45:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:45:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:45:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:45:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:45:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-14 00:45:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2022-07-14 00:45:30,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:30,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290392586] [2022-07-14 00:45:30,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290392586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:30,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:30,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:45:30,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441116225] [2022-07-14 00:45:30,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:30,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:45:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:30,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:45:30,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:30,939 INFO L87 Difference]: Start difference. First operand 644 states and 917 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-14 00:45:33,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:34,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:34,542 INFO L93 Difference]: Finished difference Result 1766 states and 2568 transitions. [2022-07-14 00:45:34,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:45:34,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 196 [2022-07-14 00:45:34,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:34,548 INFO L225 Difference]: With dead ends: 1766 [2022-07-14 00:45:34,550 INFO L226 Difference]: Without dead ends: 1159 [2022-07-14 00:45:34,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:45:34,555 INFO L413 NwaCegarLoop]: 882 mSDtfsCounter, 1564 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 831 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 2333 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:34,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 2333 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 1263 Invalid, 1 Unknown, 0 Unchecked, 3.5s Time] [2022-07-14 00:45:34,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-14 00:45:34,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 954. [2022-07-14 00:45:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 755 states have (on average 1.3562913907284768) internal successors, (1024), 759 states have internal predecessors, (1024), 147 states have call successors, (147), 48 states have call predecessors, (147), 51 states have return successors, (162), 149 states have call predecessors, (162), 147 states have call successors, (162) [2022-07-14 00:45:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1333 transitions. [2022-07-14 00:45:34,592 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1333 transitions. Word has length 196 [2022-07-14 00:45:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:34,593 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1333 transitions. [2022-07-14 00:45:34,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-07-14 00:45:34,595 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1333 transitions. [2022-07-14 00:45:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-14 00:45:34,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:34,598 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-14 00:45:34,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 00:45:34,599 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1263965729, now seen corresponding path program 1 times [2022-07-14 00:45:34,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:34,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90062829] [2022-07-14 00:45:34,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:34,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:34,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:45:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:45:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:45:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:45:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:45:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:45:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:45:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:45:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:45:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:45:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:45:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:45:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-14 00:45:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:34,826 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-14 00:45:34,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:34,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90062829] [2022-07-14 00:45:34,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90062829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:34,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:34,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:45:34,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931926148] [2022-07-14 00:45:34,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:34,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:45:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:34,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:45:34,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:34,828 INFO L87 Difference]: Start difference. First operand 954 states and 1333 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-14 00:45:37,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:39,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:41,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:42,100 INFO L93 Difference]: Finished difference Result 2078 states and 2964 transitions. [2022-07-14 00:45:42,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:45:42,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 206 [2022-07-14 00:45:42,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:42,106 INFO L225 Difference]: With dead ends: 2078 [2022-07-14 00:45:42,106 INFO L226 Difference]: Without dead ends: 1161 [2022-07-14 00:45:42,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:45:42,108 INFO L413 NwaCegarLoop]: 806 mSDtfsCounter, 755 mSDsluCounter, 1480 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 480 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 2286 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:42,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 2286 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 900 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2022-07-14 00:45:42,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2022-07-14 00:45:42,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 955. [2022-07-14 00:45:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 756 states have (on average 1.3558201058201058) internal successors, (1025), 760 states have internal predecessors, (1025), 147 states have call successors, (147), 48 states have call predecessors, (147), 51 states have return successors, (162), 149 states have call predecessors, (162), 147 states have call successors, (162) [2022-07-14 00:45:42,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1334 transitions. [2022-07-14 00:45:42,132 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1334 transitions. Word has length 206 [2022-07-14 00:45:42,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:42,133 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1334 transitions. [2022-07-14 00:45:42,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-07-14 00:45:42,133 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1334 transitions. [2022-07-14 00:45:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-14 00:45:42,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:42,135 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2022-07-14 00:45:42,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 00:45:42,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:42,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1321224031, now seen corresponding path program 1 times [2022-07-14 00:45:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:42,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509508814] [2022-07-14 00:45:42,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:42,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:42,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:45:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:45:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:45:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:45:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:45:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:45:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:45:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:45:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:45:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:45:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:45:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:45:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-14 00:45:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-14 00:45:42,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:42,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509508814] [2022-07-14 00:45:42,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509508814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:42,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:42,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:45:42,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408974940] [2022-07-14 00:45:42,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:42,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:45:42,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:42,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:45:42,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:42,396 INFO L87 Difference]: Start difference. First operand 955 states and 1334 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:45:44,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:46,660 INFO L93 Difference]: Finished difference Result 2255 states and 3250 transitions. [2022-07-14 00:45:46,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:45:46,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 206 [2022-07-14 00:45:46,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:46,668 INFO L225 Difference]: With dead ends: 2255 [2022-07-14 00:45:46,668 INFO L226 Difference]: Without dead ends: 2253 [2022-07-14 00:45:46,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:45:46,669 INFO L413 NwaCegarLoop]: 913 mSDtfsCounter, 1923 mSDsluCounter, 1875 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 922 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2020 SdHoareTripleChecker+Valid, 2788 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 922 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:46,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2020 Valid, 2788 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [922 Valid, 1321 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2022-07-14 00:45:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2022-07-14 00:45:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1803. [2022-07-14 00:45:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1431 states have (on average 1.36617749825297) internal successors, (1955), 1439 states have internal predecessors, (1955), 274 states have call successors, (274), 94 states have call predecessors, (274), 97 states have return successors, (293), 275 states have call predecessors, (293), 274 states have call successors, (293) [2022-07-14 00:45:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2522 transitions. [2022-07-14 00:45:46,737 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2522 transitions. Word has length 206 [2022-07-14 00:45:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:46,738 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2522 transitions. [2022-07-14 00:45:46,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:45:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2522 transitions. [2022-07-14 00:45:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-14 00:45:46,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:46,741 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:45:46,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 00:45:46,742 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -225403342, now seen corresponding path program 1 times [2022-07-14 00:45:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:46,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863922464] [2022-07-14 00:45:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:45:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:45:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:45:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:46,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:45:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:45:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:45:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:45:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:45:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:45:46,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:45:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:45:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:45:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-14 00:45:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-07-14 00:45:46,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:46,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863922464] [2022-07-14 00:45:46,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863922464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:46,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:46,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:45:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239115835] [2022-07-14 00:45:46,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:46,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:45:46,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:46,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:45:46,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:46,954 INFO L87 Difference]: Start difference. First operand 1803 states and 2522 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:45:49,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:51,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:51,079 INFO L93 Difference]: Finished difference Result 4787 states and 6837 transitions. [2022-07-14 00:45:51,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:45:51,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 215 [2022-07-14 00:45:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:51,089 INFO L225 Difference]: With dead ends: 4787 [2022-07-14 00:45:51,089 INFO L226 Difference]: Without dead ends: 3021 [2022-07-14 00:45:51,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:45:51,095 INFO L413 NwaCegarLoop]: 1084 mSDtfsCounter, 905 mSDsluCounter, 2418 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 511 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 3502 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 511 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:51,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 3502 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [511 Valid, 1830 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-14 00:45:51,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2022-07-14 00:45:51,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2333. [2022-07-14 00:45:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2333 states, 1865 states have (on average 1.3554959785522789) internal successors, (2528), 1875 states have internal predecessors, (2528), 334 states have call successors, (334), 130 states have call predecessors, (334), 133 states have return successors, (352), 335 states have call predecessors, (352), 334 states have call successors, (352) [2022-07-14 00:45:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2333 states to 2333 states and 3214 transitions. [2022-07-14 00:45:51,177 INFO L78 Accepts]: Start accepts. Automaton has 2333 states and 3214 transitions. Word has length 215 [2022-07-14 00:45:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:51,178 INFO L495 AbstractCegarLoop]: Abstraction has 2333 states and 3214 transitions. [2022-07-14 00:45:51,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (19), 6 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 00:45:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2333 states and 3214 transitions. [2022-07-14 00:45:51,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2022-07-14 00:45:51,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:51,196 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:45:51,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 00:45:51,196 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:51,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:51,197 INFO L85 PathProgramCache]: Analyzing trace with hash -562990724, now seen corresponding path program 1 times [2022-07-14 00:45:51,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:51,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760895801] [2022-07-14 00:45:51,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:51,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:45:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:45:51,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:45:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:51,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:45:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:45:51,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:45:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:45:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:45:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:45:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:51,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:51,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:45:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:45:51,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:45:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 00:45:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-14 00:45:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-07-14 00:45:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:51,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760895801] [2022-07-14 00:45:51,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760895801] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:51,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:51,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:45:51,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193323191] [2022-07-14 00:45:51,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:51,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:45:51,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:51,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:45:51,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:45:51,409 INFO L87 Difference]: Start difference. First operand 2333 states and 3214 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:45:54,094 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:45:55,336 INFO L93 Difference]: Finished difference Result 7027 states and 9833 transitions. [2022-07-14 00:45:55,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:45:55,336 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 236 [2022-07-14 00:45:55,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:45:55,352 INFO L225 Difference]: With dead ends: 7027 [2022-07-14 00:45:55,352 INFO L226 Difference]: Without dead ends: 4731 [2022-07-14 00:45:55,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:45:55,356 INFO L413 NwaCegarLoop]: 1230 mSDtfsCounter, 1492 mSDsluCounter, 2575 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 775 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 3805 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 775 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:45:55,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 3805 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [775 Valid, 1840 Invalid, 1 Unknown, 0 Unchecked, 3.7s Time] [2022-07-14 00:45:55,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2022-07-14 00:45:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 2337. [2022-07-14 00:45:55,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 1869 states have (on average 1.3547351524879614) internal successors, (2532), 1879 states have internal predecessors, (2532), 334 states have call successors, (334), 130 states have call predecessors, (334), 133 states have return successors, (352), 335 states have call predecessors, (352), 334 states have call successors, (352) [2022-07-14 00:45:55,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3218 transitions. [2022-07-14 00:45:55,438 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3218 transitions. Word has length 236 [2022-07-14 00:45:55,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:45:55,439 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 3218 transitions. [2022-07-14 00:45:55,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:45:55,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3218 transitions. [2022-07-14 00:45:55,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2022-07-14 00:45:55,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:45:55,442 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 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] [2022-07-14 00:45:55,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 00:45:55,442 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:45:55,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:45:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash 621597278, now seen corresponding path program 1 times [2022-07-14 00:45:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:45:55,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133288337] [2022-07-14 00:45:55,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:45:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:45:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:45:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:45:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:45:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:45:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:45:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:45:55,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:45:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:45:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:45:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:45:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:45:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:45:55,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:45:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:45:55,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:45:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:45:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 00:45:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:45:55,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-14 00:45:55,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:45:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2022-07-14 00:45:55,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:45:55,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133288337] [2022-07-14 00:45:55,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133288337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:45:55,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:45:55,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:45:55,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630286502] [2022-07-14 00:45:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:45:55,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:45:55,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:45:55,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:45:55,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:45:55,656 INFO L87 Difference]: Start difference. First operand 2337 states and 3218 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:45:57,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:45:59,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:01,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:03,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:05,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:07,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:09,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:11,597 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:12,551 INFO L93 Difference]: Finished difference Result 6111 states and 8598 transitions. [2022-07-14 00:46:12,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 00:46:12,552 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 242 [2022-07-14 00:46:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:12,564 INFO L225 Difference]: With dead ends: 6111 [2022-07-14 00:46:12,564 INFO L226 Difference]: Without dead ends: 3811 [2022-07-14 00:46:12,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:46:12,582 INFO L413 NwaCegarLoop]: 1178 mSDtfsCounter, 896 mSDsluCounter, 2401 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 495 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 2382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:12,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 3579 Invalid, 2382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1881 Invalid, 6 Unknown, 0 Unchecked, 16.7s Time] [2022-07-14 00:46:12,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2022-07-14 00:46:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 2931. [2022-07-14 00:46:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2931 states, 2354 states have (on average 1.3440951571792694) internal successors, (3164), 2367 states have internal predecessors, (3164), 398 states have call successors, (398), 172 states have call predecessors, (398), 178 states have return successors, (422), 401 states have call predecessors, (422), 398 states have call successors, (422) [2022-07-14 00:46:12,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 3984 transitions. [2022-07-14 00:46:12,698 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 3984 transitions. Word has length 242 [2022-07-14 00:46:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:12,699 INFO L495 AbstractCegarLoop]: Abstraction has 2931 states and 3984 transitions. [2022-07-14 00:46:12,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:46:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 3984 transitions. [2022-07-14 00:46:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-07-14 00:46:12,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:12,703 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:12,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 00:46:12,704 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:12,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:12,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2067512813, now seen corresponding path program 1 times [2022-07-14 00:46:12,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:12,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219153916] [2022-07-14 00:46:12,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:12,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:46:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:46:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:46:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:46:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:46:12,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:46:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:46:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 00:46:12,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-07-14 00:46:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:13,018 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-07-14 00:46:13,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:13,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219153916] [2022-07-14 00:46:13,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219153916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:13,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:13,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:46:13,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630044260] [2022-07-14 00:46:13,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:13,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:46:13,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:13,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:46:13,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:46:13,020 INFO L87 Difference]: Start difference. First operand 2931 states and 3984 transitions. Second operand has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-14 00:46:15,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:16,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:16,418 INFO L93 Difference]: Finished difference Result 6707 states and 9323 transitions. [2022-07-14 00:46:16,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:46:16,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 285 [2022-07-14 00:46:16,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:16,432 INFO L225 Difference]: With dead ends: 6707 [2022-07-14 00:46:16,432 INFO L226 Difference]: Without dead ends: 3813 [2022-07-14 00:46:16,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:46:16,438 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 1164 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 456 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 2250 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:16,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 2250 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 995 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-07-14 00:46:16,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2022-07-14 00:46:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 2845. [2022-07-14 00:46:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2280 states have (on average 1.3057017543859648) internal successors, (2977), 2293 states have internal predecessors, (2977), 390 states have call successors, (390), 172 states have call predecessors, (390), 174 states have return successors, (398), 389 states have call predecessors, (398), 390 states have call successors, (398) [2022-07-14 00:46:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 3765 transitions. [2022-07-14 00:46:16,541 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 3765 transitions. Word has length 285 [2022-07-14 00:46:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:16,542 INFO L495 AbstractCegarLoop]: Abstraction has 2845 states and 3765 transitions. [2022-07-14 00:46:16,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.428571428571427) internal successors, (115), 3 states have internal predecessors, (115), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2022-07-14 00:46:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 3765 transitions. [2022-07-14 00:46:16,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-07-14 00:46:16,546 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:16,546 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:16,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 00:46:16,547 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:16,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:16,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1247060879, now seen corresponding path program 1 times [2022-07-14 00:46:16,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:16,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861856324] [2022-07-14 00:46:16,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:16,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:46:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:46:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:46:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:46:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:16,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:46:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:46:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:46:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 00:46:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-07-14 00:46:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-07-14 00:46:16,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:16,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861856324] [2022-07-14 00:46:16,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861856324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:16,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:16,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:46:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954458219] [2022-07-14 00:46:16,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:16,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:46:16,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:16,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:46:16,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:46:16,820 INFO L87 Difference]: Start difference. First operand 2845 states and 3765 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 00:46:19,185 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:21,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:21,117 INFO L93 Difference]: Finished difference Result 9281 states and 12519 transitions. [2022-07-14 00:46:21,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 00:46:21,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 285 [2022-07-14 00:46:21,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:21,155 INFO L225 Difference]: With dead ends: 9281 [2022-07-14 00:46:21,156 INFO L226 Difference]: Without dead ends: 6473 [2022-07-14 00:46:21,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:46:21,162 INFO L413 NwaCegarLoop]: 1366 mSDtfsCounter, 1298 mSDsluCounter, 3389 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 635 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1344 SdHoareTripleChecker+Valid, 4755 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 635 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:21,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1344 Valid, 4755 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [635 Valid, 2230 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-07-14 00:46:21,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6473 states. [2022-07-14 00:46:21,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6473 to 2849. [2022-07-14 00:46:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2284 states have (on average 1.3051663747810858) internal successors, (2981), 2297 states have internal predecessors, (2981), 390 states have call successors, (390), 172 states have call predecessors, (390), 174 states have return successors, (398), 389 states have call predecessors, (398), 390 states have call successors, (398) [2022-07-14 00:46:21,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3769 transitions. [2022-07-14 00:46:21,290 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3769 transitions. Word has length 285 [2022-07-14 00:46:21,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:21,292 INFO L495 AbstractCegarLoop]: Abstraction has 2849 states and 3769 transitions. [2022-07-14 00:46:21,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 00:46:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3769 transitions. [2022-07-14 00:46:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-07-14 00:46:21,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:21,297 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:21,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 00:46:21,297 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:21,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:21,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1945847223, now seen corresponding path program 1 times [2022-07-14 00:46:21,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:21,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296071056] [2022-07-14 00:46:21,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:21,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:21,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:46:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:46:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:46:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:21,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:46:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:46:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:46:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:46:21,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 00:46:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:21,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-14 00:46:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 00:46:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-14 00:46:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-14 00:46:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 00:46:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-07-14 00:46:21,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-14 00:46:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:21,602 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2022-07-14 00:46:21,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:21,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296071056] [2022-07-14 00:46:21,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296071056] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:21,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:21,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:46:21,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318704148] [2022-07-14 00:46:21,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:21,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:46:21,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:21,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:46:21,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:46:21,605 INFO L87 Difference]: Start difference. First operand 2849 states and 3769 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-14 00:46:23,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:24,732 INFO L93 Difference]: Finished difference Result 6631 states and 8939 transitions. [2022-07-14 00:46:24,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:46:24,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 338 [2022-07-14 00:46:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:24,743 INFO L225 Difference]: With dead ends: 6631 [2022-07-14 00:46:24,744 INFO L226 Difference]: Without dead ends: 3819 [2022-07-14 00:46:24,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:46:24,749 INFO L413 NwaCegarLoop]: 770 mSDtfsCounter, 1047 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 744 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 1479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 744 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:24,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 2149 Invalid, 1479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [744 Valid, 734 Invalid, 1 Unknown, 0 Unchecked, 3.0s Time] [2022-07-14 00:46:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3819 states. [2022-07-14 00:46:24,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3819 to 2851. [2022-07-14 00:46:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2286 states have (on average 1.3048993875765529) internal successors, (2983), 2299 states have internal predecessors, (2983), 390 states have call successors, (390), 172 states have call predecessors, (390), 174 states have return successors, (398), 389 states have call predecessors, (398), 390 states have call successors, (398) [2022-07-14 00:46:24,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3771 transitions. [2022-07-14 00:46:24,894 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3771 transitions. Word has length 338 [2022-07-14 00:46:24,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:24,894 INFO L495 AbstractCegarLoop]: Abstraction has 2851 states and 3771 transitions. [2022-07-14 00:46:24,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-14 00:46:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3771 transitions. [2022-07-14 00:46:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-07-14 00:46:24,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:24,900 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:24,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 00:46:24,900 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:24,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1689588551, now seen corresponding path program 1 times [2022-07-14 00:46:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:24,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798461832] [2022-07-14 00:46:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:24,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:25,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:46:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:46:25,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:46:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:46:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:46:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:46:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:46:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 00:46:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-14 00:46:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 00:46:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-14 00:46:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-14 00:46:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 00:46:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-07-14 00:46:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-14 00:46:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2022-07-14 00:46:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:25,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798461832] [2022-07-14 00:46:25,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798461832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:25,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:25,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:46:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295084523] [2022-07-14 00:46:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:25,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:46:25,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:25,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:46:25,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:46:25,192 INFO L87 Difference]: Start difference. First operand 2851 states and 3771 transitions. Second operand has 8 states, 8 states have (on average 17.875) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-14 00:46:27,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:29,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:31,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:32,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:32,033 INFO L93 Difference]: Finished difference Result 6635 states and 8943 transitions. [2022-07-14 00:46:32,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:46:32,034 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 338 [2022-07-14 00:46:32,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:32,043 INFO L225 Difference]: With dead ends: 6635 [2022-07-14 00:46:32,044 INFO L226 Difference]: Without dead ends: 3821 [2022-07-14 00:46:32,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:46:32,057 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 714 mSDsluCounter, 1868 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 477 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 477 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:32,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 2640 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [477 Valid, 1075 Invalid, 2 Unknown, 0 Unchecked, 6.7s Time] [2022-07-14 00:46:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2022-07-14 00:46:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 2853. [2022-07-14 00:46:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2288 states have (on average 1.304632867132867) internal successors, (2985), 2301 states have internal predecessors, (2985), 390 states have call successors, (390), 172 states have call predecessors, (390), 174 states have return successors, (398), 389 states have call predecessors, (398), 390 states have call successors, (398) [2022-07-14 00:46:32,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 3773 transitions. [2022-07-14 00:46:32,182 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 3773 transitions. Word has length 338 [2022-07-14 00:46:32,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:32,183 INFO L495 AbstractCegarLoop]: Abstraction has 2853 states and 3773 transitions. [2022-07-14 00:46:32,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.875) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-14 00:46:32,183 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3773 transitions. [2022-07-14 00:46:32,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-07-14 00:46:32,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:32,186 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:32,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 00:46:32,187 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:32,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1414828937, now seen corresponding path program 1 times [2022-07-14 00:46:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:32,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896651149] [2022-07-14 00:46:32,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:32,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:46:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:46:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:46:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:46:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:46:32,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:46:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:46:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 00:46:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-14 00:46:32,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 00:46:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-14 00:46:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-14 00:46:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 00:46:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-07-14 00:46:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-14 00:46:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:32,453 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2022-07-14 00:46:32,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:32,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896651149] [2022-07-14 00:46:32,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896651149] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:32,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:46:32,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 00:46:32,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508846676] [2022-07-14 00:46:32,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:32,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 00:46:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:32,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 00:46:32,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:46:32,455 INFO L87 Difference]: Start difference. First operand 2853 states and 3773 transitions. Second operand has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-14 00:46:34,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:35,904 INFO L93 Difference]: Finished difference Result 6643 states and 8951 transitions. [2022-07-14 00:46:35,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:46:35,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 338 [2022-07-14 00:46:35,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:35,920 INFO L225 Difference]: With dead ends: 6643 [2022-07-14 00:46:35,920 INFO L226 Difference]: Without dead ends: 3827 [2022-07-14 00:46:35,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-14 00:46:35,926 INFO L413 NwaCegarLoop]: 798 mSDtfsCounter, 747 mSDsluCounter, 2274 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 559 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 3072 SdHoareTripleChecker+Invalid, 1871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:35,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 3072 Invalid, 1871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 1311 Invalid, 1 Unknown, 0 Unchecked, 3.3s Time] [2022-07-14 00:46:35,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3827 states. [2022-07-14 00:46:36,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3827 to 2857. [2022-07-14 00:46:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2857 states, 2292 states have (on average 1.3041012216404886) internal successors, (2989), 2305 states have internal predecessors, (2989), 390 states have call successors, (390), 172 states have call predecessors, (390), 174 states have return successors, (398), 389 states have call predecessors, (398), 390 states have call successors, (398) [2022-07-14 00:46:36,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2857 states to 2857 states and 3777 transitions. [2022-07-14 00:46:36,042 INFO L78 Accepts]: Start accepts. Automaton has 2857 states and 3777 transitions. Word has length 338 [2022-07-14 00:46:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:36,042 INFO L495 AbstractCegarLoop]: Abstraction has 2857 states and 3777 transitions. [2022-07-14 00:46:36,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.88888888888889) internal successors, (143), 4 states have internal predecessors, (143), 2 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-14 00:46:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2857 states and 3777 transitions. [2022-07-14 00:46:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2022-07-14 00:46:36,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:36,046 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:36,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 00:46:36,046 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:36,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash 636155061, now seen corresponding path program 1 times [2022-07-14 00:46:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:36,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778347998] [2022-07-14 00:46:36,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:46:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:46:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:46:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 00:46:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 00:46:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-14 00:46:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-14 00:46:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-14 00:46:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-07-14 00:46:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-14 00:46:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-14 00:46:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-14 00:46:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-14 00:46:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 00:46:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-07-14 00:46:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-14 00:46:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2022-07-14 00:46:36,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:36,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778347998] [2022-07-14 00:46:36,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778347998] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:36,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733671510] [2022-07-14 00:46:36,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:36,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:36,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:36,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:36,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 00:46:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:36,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 2901 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 00:46:36,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2022-07-14 00:46:37,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:46:37,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733671510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:37,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:46:37,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2022-07-14 00:46:37,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595781807] [2022-07-14 00:46:37,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:37,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:46:37,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:37,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:46:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:46:37,063 INFO L87 Difference]: Start difference. First operand 2857 states and 3777 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-14 00:46:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:37,326 INFO L93 Difference]: Finished difference Result 8489 states and 11207 transitions. [2022-07-14 00:46:37,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:46:37,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 338 [2022-07-14 00:46:37,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:37,340 INFO L225 Difference]: With dead ends: 8489 [2022-07-14 00:46:37,340 INFO L226 Difference]: Without dead ends: 5539 [2022-07-14 00:46:37,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:46:37,348 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 754 mSDsluCounter, 3900 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 5456 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:37,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 5456 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:46:37,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5539 states. [2022-07-14 00:46:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5539 to 5435. [2022-07-14 00:46:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5435 states, 4374 states have (on average 1.303840877914952) internal successors, (5703), 4389 states have internal predecessors, (5703), 737 states have call successors, (737), 319 states have call predecessors, (737), 323 states have return successors, (753), 726 states have call predecessors, (753), 737 states have call successors, (753) [2022-07-14 00:46:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5435 states to 5435 states and 7193 transitions. [2022-07-14 00:46:37,588 INFO L78 Accepts]: Start accepts. Automaton has 5435 states and 7193 transitions. Word has length 338 [2022-07-14 00:46:37,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:37,588 INFO L495 AbstractCegarLoop]: Abstraction has 5435 states and 7193 transitions. [2022-07-14 00:46:37,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 5 states have internal predecessors, (151), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-14 00:46:37,588 INFO L276 IsEmpty]: Start isEmpty. Operand 5435 states and 7193 transitions. [2022-07-14 00:46:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2022-07-14 00:46:37,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:37,596 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:37,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:37,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 00:46:37,809 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:37,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:37,809 INFO L85 PathProgramCache]: Analyzing trace with hash -948161205, now seen corresponding path program 1 times [2022-07-14 00:46:37,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:37,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399558602] [2022-07-14 00:46:37,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:37,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:38,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:38,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:46:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:46:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:46:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:46:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:46:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-14 00:46:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:46:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 00:46:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-07-14 00:46:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-07-14 00:46:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-07-14 00:46:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-14 00:46:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-07-14 00:46:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-07-14 00:46:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-07-14 00:46:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-07-14 00:46:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 00:46:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,150 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2022-07-14 00:46:38,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:38,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399558602] [2022-07-14 00:46:38,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399558602] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:38,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178127596] [2022-07-14 00:46:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:38,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:38,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:38,152 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:38,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 00:46:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:38,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 3056 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-14 00:46:38,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-07-14 00:46:38,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:46:38,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178127596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:38,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:46:38,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2022-07-14 00:46:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634341702] [2022-07-14 00:46:38,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:38,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:46:38,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:38,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:46:38,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:46:38,916 INFO L87 Difference]: Start difference. First operand 5435 states and 7193 transitions. Second operand has 8 states, 8 states have (on average 20.0) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (32), 4 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-14 00:46:39,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:39,205 INFO L93 Difference]: Finished difference Result 11753 states and 15618 transitions. [2022-07-14 00:46:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:46:39,206 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (32), 4 states have call predecessors, (32), 2 states have call successors, (32) Word has length 358 [2022-07-14 00:46:39,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:39,217 INFO L225 Difference]: With dead ends: 11753 [2022-07-14 00:46:39,217 INFO L226 Difference]: Without dead ends: 6355 [2022-07-14 00:46:39,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:46:39,224 INFO L413 NwaCegarLoop]: 986 mSDtfsCounter, 158 mSDsluCounter, 5727 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 6713 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:39,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 6713 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:46:39,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6355 states. [2022-07-14 00:46:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6355 to 5467. [2022-07-14 00:46:39,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5467 states, 4398 states have (on average 1.3021828103683493) internal successors, (5727), 4413 states have internal predecessors, (5727), 737 states have call successors, (737), 319 states have call predecessors, (737), 331 states have return successors, (773), 734 states have call predecessors, (773), 737 states have call successors, (773) [2022-07-14 00:46:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5467 states to 5467 states and 7237 transitions. [2022-07-14 00:46:39,471 INFO L78 Accepts]: Start accepts. Automaton has 5467 states and 7237 transitions. Word has length 358 [2022-07-14 00:46:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:39,471 INFO L495 AbstractCegarLoop]: Abstraction has 5467 states and 7237 transitions. [2022-07-14 00:46:39,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.0) internal successors, (160), 6 states have internal predecessors, (160), 2 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (32), 4 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-14 00:46:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 5467 states and 7237 transitions. [2022-07-14 00:46:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2022-07-14 00:46:39,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:39,478 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:39,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:39,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 00:46:39,692 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 503461736, now seen corresponding path program 1 times [2022-07-14 00:46:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:39,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162507434] [2022-07-14 00:46:39,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:39,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 00:46:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-14 00:46:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-14 00:46:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:46:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-14 00:46:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 00:46:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-14 00:46:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 00:46:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 00:46:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2022-07-14 00:46:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-07-14 00:46:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-07-14 00:46:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-07-14 00:46:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-14 00:46:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-07-14 00:46:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-14 00:46:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2022-07-14 00:46:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-14 00:46:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2022-07-14 00:46:39,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:39,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162507434] [2022-07-14 00:46:39,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162507434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:39,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383686647] [2022-07-14 00:46:39,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:39,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:39,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:39,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:39,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 00:46:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:40,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 3082 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 00:46:40,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-07-14 00:46:40,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:46:40,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383686647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:40,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:46:40,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-07-14 00:46:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273552327] [2022-07-14 00:46:40,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:40,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:46:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:46:40,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:46:40,709 INFO L87 Difference]: Start difference. First operand 5467 states and 7237 transitions. Second operand has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-14 00:46:40,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:40,934 INFO L93 Difference]: Finished difference Result 10915 states and 14452 transitions. [2022-07-14 00:46:40,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:46:40,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 364 [2022-07-14 00:46:40,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:40,944 INFO L225 Difference]: With dead ends: 10915 [2022-07-14 00:46:40,944 INFO L226 Difference]: Without dead ends: 5468 [2022-07-14 00:46:40,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-14 00:46:40,951 INFO L413 NwaCegarLoop]: 802 mSDtfsCounter, 3 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:40,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2395 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:46:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5468 states. [2022-07-14 00:46:41,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5468 to 5468. [2022-07-14 00:46:41,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5468 states, 4399 states have (on average 1.3021141168447374) internal successors, (5728), 4414 states have internal predecessors, (5728), 737 states have call successors, (737), 319 states have call predecessors, (737), 331 states have return successors, (773), 734 states have call predecessors, (773), 737 states have call successors, (773) [2022-07-14 00:46:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5468 states to 5468 states and 7238 transitions. [2022-07-14 00:46:41,168 INFO L78 Accepts]: Start accepts. Automaton has 5468 states and 7238 transitions. Word has length 364 [2022-07-14 00:46:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:41,168 INFO L495 AbstractCegarLoop]: Abstraction has 5468 states and 7238 transitions. [2022-07-14 00:46:41,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.25) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (35), 2 states have call predecessors, (35), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-14 00:46:41,168 INFO L276 IsEmpty]: Start isEmpty. Operand 5468 states and 7238 transitions. [2022-07-14 00:46:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2022-07-14 00:46:41,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:41,173 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:41,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:41,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:41,383 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:41,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1576084639, now seen corresponding path program 1 times [2022-07-14 00:46:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:41,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791088838] [2022-07-14 00:46:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:41,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:41,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-14 00:46:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-14 00:46:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 00:46:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 00:46:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 00:46:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:46:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 00:46:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-14 00:46:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-14 00:46:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-14 00:46:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-14 00:46:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-14 00:46:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-07-14 00:46:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-14 00:46:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-07-14 00:46:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-14 00:46:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-07-14 00:46:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-14 00:46:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-07-14 00:46:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-14 00:46:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:41,702 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 605 trivial. 0 not checked. [2022-07-14 00:46:41,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:41,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791088838] [2022-07-14 00:46:41,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791088838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:41,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320779673] [2022-07-14 00:46:41,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:41,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:41,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:41,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:41,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 00:46:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:42,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 3157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 00:46:42,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:42,481 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 280 proven. 1 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2022-07-14 00:46:42,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:46:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2022-07-14 00:46:42,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320779673] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:46:42,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:46:42,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 16 [2022-07-14 00:46:42,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815589921] [2022-07-14 00:46:42,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:46:42,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 00:46:42,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:42,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 00:46:42,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:46:42,740 INFO L87 Difference]: Start difference. First operand 5468 states and 7238 transitions. Second operand has 16 states, 16 states have (on average 12.8125) internal successors, (205), 10 states have internal predecessors, (205), 2 states have call successors, (83), 7 states have call predecessors, (83), 5 states have return successors, (60), 3 states have call predecessors, (60), 2 states have call successors, (60) [2022-07-14 00:46:45,659 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:46:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:47,448 INFO L93 Difference]: Finished difference Result 12846 states and 17321 transitions. [2022-07-14 00:46:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 00:46:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 12.8125) internal successors, (205), 10 states have internal predecessors, (205), 2 states have call successors, (83), 7 states have call predecessors, (83), 5 states have return successors, (60), 3 states have call predecessors, (60), 2 states have call successors, (60) Word has length 369 [2022-07-14 00:46:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:47,466 INFO L225 Difference]: With dead ends: 12846 [2022-07-14 00:46:47,467 INFO L226 Difference]: Without dead ends: 7394 [2022-07-14 00:46:47,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 850 GetRequests, 820 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=794, Unknown=0, NotChecked=0, Total=992 [2022-07-14 00:46:47,478 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 632 mSDsluCounter, 5466 mSDsCounter, 0 mSdLazyCounter, 3032 mSolverCounterSat, 385 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 6223 SdHoareTripleChecker+Invalid, 3418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 3032 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:47,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 6223 Invalid, 3418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 3032 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2022-07-14 00:46:47,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7394 states. [2022-07-14 00:46:47,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7394 to 5452. [2022-07-14 00:46:47,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5452 states, 4382 states have (on average 1.301004107713373) internal successors, (5701), 4397 states have internal predecessors, (5701), 736 states have call successors, (736), 320 states have call predecessors, (736), 333 states have return successors, (773), 734 states have call predecessors, (773), 736 states have call successors, (773) [2022-07-14 00:46:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5452 states to 5452 states and 7210 transitions. [2022-07-14 00:46:47,730 INFO L78 Accepts]: Start accepts. Automaton has 5452 states and 7210 transitions. Word has length 369 [2022-07-14 00:46:47,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:47,731 INFO L495 AbstractCegarLoop]: Abstraction has 5452 states and 7210 transitions. [2022-07-14 00:46:47,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 12.8125) internal successors, (205), 10 states have internal predecessors, (205), 2 states have call successors, (83), 7 states have call predecessors, (83), 5 states have return successors, (60), 3 states have call predecessors, (60), 2 states have call successors, (60) [2022-07-14 00:46:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5452 states and 7210 transitions. [2022-07-14 00:46:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2022-07-14 00:46:47,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:47,737 INFO L195 NwaCegarLoop]: trace histogram [18, 10, 10, 10, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:47,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:47,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 00:46:47,952 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:47,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:47,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1765176347, now seen corresponding path program 2 times [2022-07-14 00:46:47,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:47,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357705590] [2022-07-14 00:46:47,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:47,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:48,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 00:46:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-14 00:46:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 00:46:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-14 00:46:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 00:46:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 00:46:48,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-14 00:46:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-14 00:46:48,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-07-14 00:46:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 00:46:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-07-14 00:46:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-14 00:46:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-14 00:46:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-07-14 00:46:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2022-07-14 00:46:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-07-14 00:46:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-07-14 00:46:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2022-07-14 00:46:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-07-14 00:46:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2022-07-14 00:46:48,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2022-07-14 00:46:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2022-07-14 00:46:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2022-07-14 00:46:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2022-07-14 00:46:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:48,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357705590] [2022-07-14 00:46:48,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357705590] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:48,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435586674] [2022-07-14 00:46:48,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:46:48,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:48,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:48,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 00:46:51,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:46:51,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:46:51,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 3378 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 00:46:51,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 865 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 710 trivial. 0 not checked. [2022-07-14 00:46:51,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:46:51,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435586674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:51,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:46:51,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 19 [2022-07-14 00:46:51,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55434052] [2022-07-14 00:46:51,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:51,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:46:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:51,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:46:51,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2022-07-14 00:46:51,430 INFO L87 Difference]: Start difference. First operand 5452 states and 7210 transitions. Second operand has 7 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 3 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-14 00:46:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:51,664 INFO L93 Difference]: Finished difference Result 10923 states and 14458 transitions. [2022-07-14 00:46:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:46:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 3 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 388 [2022-07-14 00:46:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:51,678 INFO L225 Difference]: With dead ends: 10923 [2022-07-14 00:46:51,678 INFO L226 Difference]: Without dead ends: 5474 [2022-07-14 00:46:51,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 475 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-14 00:46:51,690 INFO L413 NwaCegarLoop]: 799 mSDtfsCounter, 2 mSDsluCounter, 3971 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4770 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:51,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4770 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:46:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5474 states. [2022-07-14 00:46:51,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5474 to 5450. [2022-07-14 00:46:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5450 states, 4381 states have (on average 1.3008445560374344) internal successors, (5699), 4395 states have internal predecessors, (5699), 736 states have call successors, (736), 320 states have call predecessors, (736), 332 states have return successors, (772), 734 states have call predecessors, (772), 736 states have call successors, (772) [2022-07-14 00:46:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5450 states to 5450 states and 7207 transitions. [2022-07-14 00:46:51,964 INFO L78 Accepts]: Start accepts. Automaton has 5450 states and 7207 transitions. Word has length 388 [2022-07-14 00:46:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:51,964 INFO L495 AbstractCegarLoop]: Abstraction has 5450 states and 7207 transitions. [2022-07-14 00:46:51,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 26.833333333333332) internal successors, (161), 6 states have internal predecessors, (161), 3 states have call successors, (35), 2 states have call predecessors, (35), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2022-07-14 00:46:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 5450 states and 7207 transitions. [2022-07-14 00:46:51,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2022-07-14 00:46:51,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:51,971 INFO L195 NwaCegarLoop]: trace histogram [18, 11, 11, 11, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:52,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 00:46:52,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 00:46:52,200 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:52,200 INFO L85 PathProgramCache]: Analyzing trace with hash 42825474, now seen corresponding path program 3 times [2022-07-14 00:46:52,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:52,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427474220] [2022-07-14 00:46:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:52,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:46:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:46:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:46:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:46:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 00:46:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 00:46:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:46:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:46:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:46:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-14 00:46:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-14 00:46:52,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-14 00:46:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 00:46:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-14 00:46:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 00:46:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-14 00:46:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-07-14 00:46:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-07-14 00:46:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2022-07-14 00:46:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 00:46:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-07-14 00:46:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2022-07-14 00:46:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 380 [2022-07-14 00:46:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 33 proven. 8 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2022-07-14 00:46:52,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:52,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427474220] [2022-07-14 00:46:52,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427474220] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:52,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669873752] [2022-07-14 00:46:52,670 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 00:46:52,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:52,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:52,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:52,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 00:46:53,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 00:46:53,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:46:53,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 2345 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-14 00:46:53,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:53,890 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 816 trivial. 0 not checked. [2022-07-14 00:46:53,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:46:53,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669873752] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:46:53,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:46:53,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 15 [2022-07-14 00:46:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042544557] [2022-07-14 00:46:53,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:46:53,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:46:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:46:53,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-07-14 00:46:53,893 INFO L87 Difference]: Start difference. First operand 5450 states and 7207 transitions. Second operand has 10 states, 10 states have (on average 16.3) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-14 00:46:54,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:46:54,194 INFO L93 Difference]: Finished difference Result 12328 states and 16412 transitions. [2022-07-14 00:46:54,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 00:46:54,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 2 states have call successors, (34) Word has length 394 [2022-07-14 00:46:54,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:46:54,212 INFO L225 Difference]: With dead ends: 12328 [2022-07-14 00:46:54,212 INFO L226 Difference]: Without dead ends: 6940 [2022-07-14 00:46:54,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:46:54,224 INFO L413 NwaCegarLoop]: 1074 mSDtfsCounter, 221 mSDsluCounter, 8318 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 9392 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:46:54,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 9392 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:46:54,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6940 states. [2022-07-14 00:46:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6940 to 5494. [2022-07-14 00:46:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5494 states, 4413 states have (on average 1.2986630410151825) internal successors, (5731), 4427 states have internal predecessors, (5731), 736 states have call successors, (736), 320 states have call predecessors, (736), 344 states have return successors, (808), 746 states have call predecessors, (808), 736 states have call successors, (808) [2022-07-14 00:46:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5494 states to 5494 states and 7275 transitions. [2022-07-14 00:46:54,457 INFO L78 Accepts]: Start accepts. Automaton has 5494 states and 7275 transitions. Word has length 394 [2022-07-14 00:46:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:46:54,458 INFO L495 AbstractCegarLoop]: Abstraction has 5494 states and 7275 transitions. [2022-07-14 00:46:54,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.3) internal successors, (163), 7 states have internal predecessors, (163), 2 states have call successors, (34), 2 states have call predecessors, (34), 5 states have return successors, (34), 5 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-14 00:46:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5494 states and 7275 transitions. [2022-07-14 00:46:54,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2022-07-14 00:46:54,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:46:54,465 INFO L195 NwaCegarLoop]: trace histogram [18, 12, 12, 12, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:46:54,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-14 00:46:54,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:54,679 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:46:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:46:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 660818719, now seen corresponding path program 4 times [2022-07-14 00:46:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:46:54,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74101527] [2022-07-14 00:46:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:46:54,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:46:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-14 00:46:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-14 00:46:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 00:46:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-14 00:46:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:54,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 00:46:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-14 00:46:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-14 00:46:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:54,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 00:46:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-14 00:46:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-14 00:46:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 00:46:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-14 00:46:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-07-14 00:46:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2022-07-14 00:46:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-07-14 00:46:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 00:46:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-07-14 00:46:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-07-14 00:46:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-07-14 00:46:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 00:46:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-07-14 00:46:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 00:46:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-07-14 00:46:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-07-14 00:46:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-07-14 00:46:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 355 [2022-07-14 00:46:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 370 [2022-07-14 00:46:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 00:46:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:46:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2022-07-14 00:46:55,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 00:46:55,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74101527] [2022-07-14 00:46:55,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74101527] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 00:46:55,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291632122] [2022-07-14 00:46:55,187 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 00:46:55,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:46:55,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:46:55,189 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 00:46:55,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 00:46:56,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 00:46:56,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:46:56,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 3430 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 00:46:56,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:46:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 375 proven. 112 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2022-07-14 00:46:56,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:46:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 959 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2022-07-14 00:46:56,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291632122] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:46:56,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 00:46:56,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 6] total 22 [2022-07-14 00:46:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247238704] [2022-07-14 00:46:56,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 00:46:56,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 00:46:56,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 00:46:56,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 00:46:56,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2022-07-14 00:46:56,742 INFO L87 Difference]: Start difference. First operand 5494 states and 7275 transitions. Second operand has 22 states, 22 states have (on average 9.409090909090908) internal successors, (207), 17 states have internal predecessors, (207), 2 states have call successors, (79), 7 states have call predecessors, (79), 5 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2022-07-14 00:46:58,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:00,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:02,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:04,553 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:06,593 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:08,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:10,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:12,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:14,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:47:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:47:16,178 INFO L93 Difference]: Finished difference Result 12841 states and 17325 transitions. [2022-07-14 00:47:16,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 00:47:16,179 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 9.409090909090908) internal successors, (207), 17 states have internal predecessors, (207), 2 states have call successors, (79), 7 states have call predecessors, (79), 5 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 400 [2022-07-14 00:47:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:47:16,195 INFO L225 Difference]: With dead ends: 12841 [2022-07-14 00:47:16,195 INFO L226 Difference]: Without dead ends: 7372 [2022-07-14 00:47:16,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 882 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=349, Invalid=1211, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 00:47:16,207 INFO L413 NwaCegarLoop]: 787 mSDtfsCounter, 718 mSDsluCounter, 2921 mSDsCounter, 0 mSdLazyCounter, 1895 mSolverCounterSat, 524 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 3708 SdHoareTripleChecker+Invalid, 2425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 524 IncrementalHoareTripleChecker+Valid, 1895 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:47:16,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 3708 Invalid, 2425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [524 Valid, 1895 Invalid, 6 Unknown, 0 Unchecked, 18.7s Time] [2022-07-14 00:47:16,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7372 states. [2022-07-14 00:47:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7372 to 5500. [2022-07-14 00:47:16,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5500 states, 4419 states have (on average 1.2975786377008374) internal successors, (5734), 4433 states have internal predecessors, (5734), 736 states have call successors, (736), 320 states have call predecessors, (736), 344 states have return successors, (808), 746 states have call predecessors, (808), 736 states have call successors, (808) [2022-07-14 00:47:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5500 states to 5500 states and 7278 transitions. [2022-07-14 00:47:16,476 INFO L78 Accepts]: Start accepts. Automaton has 5500 states and 7278 transitions. Word has length 400 [2022-07-14 00:47:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:47:16,476 INFO L495 AbstractCegarLoop]: Abstraction has 5500 states and 7278 transitions. [2022-07-14 00:47:16,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.409090909090908) internal successors, (207), 17 states have internal predecessors, (207), 2 states have call successors, (79), 7 states have call predecessors, (79), 5 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2022-07-14 00:47:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5500 states and 7278 transitions. [2022-07-14 00:47:16,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2022-07-14 00:47:16,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:16,482 INFO L195 NwaCegarLoop]: trace histogram [24, 12, 12, 12, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:47:16,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 00:47:16,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 00:47:16,695 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:16,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:16,696 INFO L85 PathProgramCache]: Analyzing trace with hash 79681727, now seen corresponding path program 5 times [2022-07-14 00:47:16,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 00:47:16,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565402398] [2022-07-14 00:47:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:47:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 00:47:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 00:47:17,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 00:47:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 00:47:19,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 00:47:19,494 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-14 00:47:19,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-14 00:47:19,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 00:47:19,498 INFO L356 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:47:19,502 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 00:47:19,548 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,549 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,549 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,550 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,550 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,550 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,551 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,552 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,553 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,553 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,553 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,553 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,553 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,553 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,554 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,555 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,555 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,555 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,555 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,555 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,555 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,555 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,559 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,560 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,561 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,562 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,563 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,564 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,564 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,564 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,564 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,564 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,564 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,564 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,565 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,566 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,566 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,566 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,566 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,566 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,566 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,566 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,567 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,567 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,567 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,567 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,567 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,567 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,567 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,568 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,568 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,568 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,568 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,568 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,568 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,568 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,569 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,569 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,569 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled [2022-07-14 00:47:19,569 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,569 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled [2022-07-14 00:47:19,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 12:47:19 BoogieIcfgContainer [2022-07-14 00:47:19,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 00:47:19,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 00:47:19,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 00:47:19,796 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 00:47:19,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:45:22" (3/4) ... [2022-07-14 00:47:19,799 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 00:47:19,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 00:47:19,799 INFO L158 Benchmark]: Toolchain (without parser) took 121252.50ms. Allocated memory was 100.7MB in the beginning and 891.3MB in the end (delta: 790.6MB). Free memory was 64.3MB in the beginning and 460.7MB in the end (delta: -396.4MB). Peak memory consumption was 394.9MB. Max. memory is 16.1GB. [2022-07-14 00:47:19,800 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 100.7MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:47:19,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1013.26ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.2MB in the beginning and 65.6MB in the end (delta: -1.4MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2022-07-14 00:47:19,800 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.46ms. Allocated memory is still 121.6MB. Free memory was 65.6MB in the beginning and 53.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-14 00:47:19,802 INFO L158 Benchmark]: Boogie Preprocessor took 132.04ms. Allocated memory is still 121.6MB. Free memory was 53.9MB in the beginning and 69.5MB in the end (delta: -15.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-07-14 00:47:19,802 INFO L158 Benchmark]: RCFGBuilder took 2924.48ms. Allocated memory was 121.6MB in the beginning and 178.3MB in the end (delta: 56.6MB). Free memory was 69.5MB in the beginning and 114.9MB in the end (delta: -45.4MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2022-07-14 00:47:19,802 INFO L158 Benchmark]: TraceAbstraction took 117064.75ms. Allocated memory was 178.3MB in the beginning and 891.3MB in the end (delta: 713.0MB). Free memory was 113.8MB in the beginning and 460.7MB in the end (delta: -346.9MB). Peak memory consumption was 591.4MB. Max. memory is 16.1GB. [2022-07-14 00:47:19,802 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 891.3MB. Free memory is still 460.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 00:47:19,809 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.20ms. Allocated memory is still 100.7MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 46.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1013.26ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.2MB in the beginning and 65.6MB in the end (delta: -1.4MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.46ms. Allocated memory is still 121.6MB. Free memory was 65.6MB in the beginning and 53.9MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 132.04ms. Allocated memory is still 121.6MB. Free memory was 53.9MB in the beginning and 69.5MB in the end (delta: -15.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2924.48ms. Allocated memory was 121.6MB in the beginning and 178.3MB in the end (delta: 56.6MB). Free memory was 69.5MB in the beginning and 114.9MB in the end (delta: -45.4MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * TraceAbstraction took 117064.75ms. Allocated memory was 178.3MB in the beginning and 891.3MB in the end (delta: 713.0MB). Free memory was 113.8MB in the beginning and 460.7MB in the end (delta: -346.9MB). Peak memory consumption was 591.4MB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 891.3MB. Free memory is still 460.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_memset_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 4715]: 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 3478, overapproximation of bitwiseOr at line 3789. Possible FailurePath: [L3397] int LDV_IN_INTERRUPT = 1; [L3398] int ldv_state_variable_2 ; [L3399] struct usb_serial *kobil_device_group2 ; [L3400] int ref_cnt ; [L3401] struct usb_interface *kobil_driver_group1 ; [L3402] struct usb_serial_port *kobil_device_group0 ; [L3403] struct file *kobil_device_group1 ; [L3404] int ldv_state_variable_1 ; [L3405] int usb_counter ; [L3406] struct tty_struct *kobil_device_group3 ; [L3407] int ldv_state_variable_0 ; [L3561] static int debug ; [L3579-L3589] static struct usb_device_id const id_table[5U] = { {3U, 3398U, 8209U, (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}, {3U, 3398U, 8210U, (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}, {3U, 3398U, 120U, (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}, {3U, 3398U, 129U, (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}}; [L3590] struct usb_device_id const __mod_usb_device_table ; [L3591-L3596] static struct usb_driver kobil_driver = {"kobil", & usb_serial_probe, & usb_serial_disconnect, 0, 0, 0, 0, 0, 0, (struct usb_device_id const *)(& id_table), {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, {{0, 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, 0}, 1U, (unsigned char)0, (unsigned char)0}; [L3597-L3604] static struct usb_serial_driver kobil_device = {"KOBIL USB smart card terminal", (struct usb_device_id const *)(& id_table), 1, {0, 0}, {"kobil", 0, & __this_module, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0}, & kobil_driver, {{{{{0U}, 0U, 0U, 0, {0, {0, 0}, 0, 0, 0UL}}}}, {0, 0}}, 0UL, 0UL, 0, & kobil_startup, 0, 0, & kobil_release, 0, 0, 0, 0, & kobil_open, & kobil_close, & kobil_write, & kobil_write_room, & kobil_ioctl, & kobil_set_termios, 0, 0, 0, 0, & kobil_tiocmget, & kobil_tiocmset, 0, 0, 0, & kobil_init_termios, & kobil_read_int_callback, 0, 0, 0, 0, 0}; [L4260] int ldv_retval_2 ; [L4262] int ldv_retval_0 ; [L4264] int ldv_retval_1 ; [L4266] int ldv_retval_3 ; [L4718] struct tty_struct *ldv_latest_tty ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L4294] unsigned char *ldvarg7 ; [L4295] void *tmp ; [L4296] unsigned int ldvarg3 ; [L4297] unsigned int ldvarg0 ; [L4298] struct urb *ldvarg5 ; [L4299] void *tmp___0 ; [L4300] int ldvarg6 ; [L4301] unsigned int ldvarg1 ; [L4302] struct ktermios *ldvarg4 ; [L4303] void *tmp___1 ; [L4304] unsigned long ldvarg2 ; [L4305] struct usb_device_id *ldvarg8 ; [L4306] void *tmp___2 ; [L4307] int tmp___3 ; [L4308] int tmp___4 ; [L4309] int tmp___5 ; [L4310] int tmp___6 ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg6={110680464442257309714:0}, ref_cnt=0, usb_counter=0] [L4312] CALL, EXPR ldv_init_zalloc(1UL) VAL [\old(size)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3357] void *p ; [L3358] void *tmp ; [L3360] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={18446744073709551617:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=1, usb_counter=0] [L3360] tmp = calloc(1UL, size) [L3361] p = tmp VAL [\old(size)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={18446744073709551617:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={18446744073709551617:0}, ref_cnt=0, size=1, tmp={18446744073709551617:0}, usb_counter=0] [L3362] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3362] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={18446744073709551617:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={18446744073709551617:0}, ref_cnt=0, size=1, tmp={18446744073709551617:0}, usb_counter=0] [L3363] return (p); VAL [\old(size)=1, \result={18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={18446744073709551617:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={18446744073709551617:0}, ref_cnt=0, size=1, tmp={18446744073709551617:0}, usb_counter=0] [L4312] RET, EXPR ldv_init_zalloc(1UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1UL)={18446744073709551617:0}, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg6={110680464442257309714:0}, ref_cnt=0, usb_counter=0] [L4312] tmp = ldv_init_zalloc(1UL) [L4313] ldvarg7 = (unsigned char *)tmp VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ref_cnt=0, tmp={18446744073709551617:0}, usb_counter=0] [L4314] CALL, EXPR ldv_malloc(192UL) VAL [\old(size)=192, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3323] void *p ; [L3324] void *tmp ; [L3325] int tmp___0 ; [L3327] tmp___0 = __VERIFIER_nondet_int() [L3328] COND FALSE !(tmp___0 != 0) [L3331] tmp = malloc(size) [L3332] p = tmp VAL [\old(size)=192, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=192, tmp={-18446744073709551617:0}, tmp___0=0, usb_counter=0] [L3333] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3333] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=192, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=192, tmp={-18446744073709551617:0}, tmp___0=0, usb_counter=0] [L3334] return (p); VAL [\old(size)=192, \result={-18446744073709551617:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-18446744073709551617:0}, ref_cnt=0, size=192, tmp={-18446744073709551617:0}, tmp___0=0, usb_counter=0] [L4314] RET, EXPR ldv_malloc(192UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_malloc(192UL)={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ref_cnt=0, tmp={18446744073709551617:0}, usb_counter=0] [L4314] tmp___0 = ldv_malloc(192UL) [L4315] CALL assume_abort_if_not((unsigned long )tmp___0 != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L4315] RET assume_abort_if_not((unsigned long )tmp___0 != (unsigned long )((void *)0)) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, usb_counter=0] [L4316] ldvarg5 = (struct urb *)tmp___0 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, usb_counter=0] [L4317] CALL, EXPR ldv_init_zalloc(44UL) VAL [\old(size)=44, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3357] void *p ; [L3358] void *tmp ; [L3360] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=44, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={92233720368547758081:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=44, usb_counter=0] [L3360] tmp = calloc(1UL, size) [L3361] p = tmp VAL [\old(size)=44, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={92233720368547758081:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={92233720368547758081:0}, ref_cnt=0, size=44, tmp={92233720368547758081:0}, usb_counter=0] [L3362] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3362] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=44, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={92233720368547758081:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={92233720368547758081:0}, ref_cnt=0, size=44, tmp={92233720368547758081:0}, usb_counter=0] [L3363] return (p); VAL [\old(size)=44, \result={92233720368547758081:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={92233720368547758081:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={92233720368547758081:0}, ref_cnt=0, size=44, tmp={92233720368547758081:0}, usb_counter=0] [L4317] RET, EXPR ldv_init_zalloc(44UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(44UL)={92233720368547758081:0}, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, usb_counter=0] [L4317] tmp___1 = ldv_init_zalloc(44UL) [L4318] ldvarg4 = (struct ktermios *)tmp___1 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, usb_counter=0] [L4319] CALL, EXPR ldv_init_zalloc(24UL) VAL [\old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3357] void *p ; [L3358] void *tmp ; [L3360] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-36893488147419103233:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, size=24, usb_counter=0] [L3360] tmp = calloc(1UL, size) [L3361] p = tmp VAL [\old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-36893488147419103233:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=24, tmp={-36893488147419103233:0}, usb_counter=0] [L3362] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3362] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=24, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-36893488147419103233:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=24, tmp={-36893488147419103233:0}, usb_counter=0] [L3363] return (p); VAL [\old(size)=24, \result={-36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-36893488147419103233:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-36893488147419103233:0}, ref_cnt=0, size=24, tmp={-36893488147419103233:0}, usb_counter=0] [L4319] RET, EXPR ldv_init_zalloc(24UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(24UL)={-36893488147419103233:0}, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, usb_counter=0] [L4319] tmp___2 = ldv_init_zalloc(24UL) [L4320] ldvarg8 = (struct usb_device_id *)tmp___2 [L4321] CALL ldv_initialize() [L4722] CALL, EXPR ldv_malloc(sizeof(struct tty_struct)) VAL [\old(size)=2516, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3323] void *p ; [L3324] void *tmp ; [L3325] int tmp___0 ; [L3327] tmp___0 = __VERIFIER_nondet_int() [L3328] COND FALSE !(tmp___0 != 0) [L3331] tmp = malloc(size) [L3332] p = tmp VAL [\old(size)=2516, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-36893488147419103231:0}, ref_cnt=0, size=2516, tmp={-36893488147419103231:0}, tmp___0=0, usb_counter=0] [L3333] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3333] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2516, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-36893488147419103231:0}, ref_cnt=0, size=2516, tmp={-36893488147419103231:0}, tmp___0=0, usb_counter=0] [L3334] return (p); VAL [\old(size)=2516, \result={-36893488147419103231:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, p={-36893488147419103231:0}, ref_cnt=0, size=2516, tmp={-36893488147419103231:0}, tmp___0=0, usb_counter=0] [L4722] RET, EXPR ldv_malloc(sizeof(struct tty_struct)) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_malloc(sizeof(struct tty_struct))={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L4722] ldv_latest_tty = ldv_malloc(sizeof(struct tty_struct)) [L4723] COND FALSE !((unsigned long )ldv_latest_tty == (unsigned long )((struct tty_struct *)0)) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L4321] RET ldv_initialize() [L4322] CALL ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3368] void *tmp ; [L3370] EXPR, FCALL memset(s, c, n) [L3370] tmp = memset(s, c, n) [L3371] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={110680464442257309711:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, c=0, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, n=4, ref_cnt=0, s={110680464442257309711:0}, s={110680464442257309711:0}, tmp={110680464442257309711:0}, usb_counter=0] [L4322] RET ldv_memset((void *)(& ldvarg3), 0, 4UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_memset((void *)(& ldvarg3), 0, 4UL)={110680464442257309711:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, usb_counter=0] [L4323] CALL ldv_memset((void *)(& ldvarg0), 0, 4UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3368] void *tmp ; [L3370] EXPR, FCALL memset(s, c, n) [L3370] tmp = memset(s, c, n) [L3371] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={110680464442257309699:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, c=0, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, n=4, ref_cnt=0, s={110680464442257309699:0}, s={110680464442257309699:0}, tmp={110680464442257309699:0}, usb_counter=0] [L4323] RET ldv_memset((void *)(& ldvarg0), 0, 4UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_memset((void *)(& ldvarg0), 0, 4UL)={110680464442257309699:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, usb_counter=0] [L4324] CALL ldv_memset((void *)(& ldvarg6), 0, 4UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3368] void *tmp ; [L3370] EXPR, FCALL memset(s, c, n) [L3370] tmp = memset(s, c, n) [L3371] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={110680464442257309714:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, c=0, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, n=4, ref_cnt=0, s={110680464442257309714:0}, s={110680464442257309714:0}, tmp={110680464442257309714:0}, usb_counter=0] [L4324] RET ldv_memset((void *)(& ldvarg6), 0, 4UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_memset((void *)(& ldvarg6), 0, 4UL)={110680464442257309714:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, usb_counter=0] [L4325] CALL ldv_memset((void *)(& ldvarg1), 0, 4UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3368] void *tmp ; [L3370] EXPR, FCALL memset(s, c, n) [L3370] tmp = memset(s, c, n) [L3371] return (tmp); VAL [\old(c)=0, \old(n)=4, \result={110680464442257309709:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, c=0, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, n=4, ref_cnt=0, s={110680464442257309709:0}, s={110680464442257309709:0}, tmp={110680464442257309709:0}, usb_counter=0] [L4325] RET ldv_memset((void *)(& ldvarg1), 0, 4UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_memset((void *)(& ldvarg1), 0, 4UL)={110680464442257309709:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, usb_counter=0] [L4326] CALL ldv_memset((void *)(& ldvarg2), 0, 8UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ref_cnt=0, usb_counter=0] [L3368] void *tmp ; [L3370] EXPR, FCALL memset(s, c, n) [L3370] tmp = memset(s, c, n) [L3371] return (tmp); VAL [\old(c)=0, \old(n)=8, \result={110680464442257309713:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, c=0, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, n=8, ref_cnt=0, s={110680464442257309713:0}, s={110680464442257309713:0}, tmp={110680464442257309713:0}, usb_counter=0] [L4326] RET ldv_memset((void *)(& ldvarg2), 0, 8UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_memset((void *)(& ldvarg2), 0, 8UL)={110680464442257309713:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, usb_counter=0] [L4327] ldv_state_variable_1 = 0 [L4328] ref_cnt = 0 [L4329] ldv_state_variable_0 = 1 [L4330] ldv_state_variable_2 = 0 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, usb_counter=0] [L4332] tmp___3 = __VERIFIER_nondet_int() [L4334] case 0: [L4547] case 1: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=1, usb_counter=0] [L4548] COND TRUE ldv_state_variable_0 != 0 [L4549] tmp___5 = __VERIFIER_nondet_int() [L4551] case 0: [L4559] case 1: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=1, tmp___5=1, usb_counter=0] [L4560] COND TRUE ldv_state_variable_0 == 1 [L4561] CALL, EXPR kobil_init() [L4231] int retval ; [L4233] CALL, EXPR usb_serial_register(& kobil_device) [L4845] return __VERIFIER_nondet_int(); [L4233] RET, EXPR usb_serial_register(& kobil_device) [L4233] retval = usb_serial_register(& kobil_device) [L4234] COND FALSE !(retval != 0) [L4238] CALL, EXPR usb_register(& kobil_driver) [L3476] int tmp ; [L3478] CALL, EXPR ldv_usb_register_driver_6(driver, & __this_module, "kobil_sct") [L4656] ldv_func_ret_type___0 ldv_func_res ; [L4657] int tmp ; [L4659] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4831] return __VERIFIER_nondet_int(); [L4659] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4659] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L4660] ldv_func_res = tmp [L4661] ldv_state_variable_2 = 1 [L4662] usb_counter = 0 [L4663] CALL ldv_usb_driver_2() [L4285] void *tmp ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L4287] CALL, EXPR ldv_init_zalloc(1248UL) VAL [\old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3357] void *p ; [L3358] void *tmp ; [L3360] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-55340232221128654849:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, size=1248, usb_counter=0] [L3360] tmp = calloc(1UL, size) [L3361] p = tmp VAL [\old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-55340232221128654849:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, p={-55340232221128654849:0}, ref_cnt=0, size=1248, tmp={-55340232221128654849:0}, usb_counter=0] [L3362] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3362] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=1248, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-55340232221128654849:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, p={-55340232221128654849:0}, ref_cnt=0, size=1248, tmp={-55340232221128654849:0}, usb_counter=0] [L3363] return (p); VAL [\old(size)=1248, \result={-55340232221128654849:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-55340232221128654849:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, p={-55340232221128654849:0}, ref_cnt=0, size=1248, tmp={-55340232221128654849:0}, usb_counter=0] [L4287] RET, EXPR ldv_init_zalloc(1248UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={0:0}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(1248UL)={-55340232221128654849:0}, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L4287] tmp = ldv_init_zalloc(1248UL) [L4288] kobil_driver_group1 = (struct usb_interface *)tmp VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, tmp={-55340232221128654849:0}, usb_counter=0] [L4663] RET ldv_usb_driver_2() [L4664] return (ldv_func_res); VAL [\result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, ldv_func_arg1={100:0}, ldv_func_arg1={100:0}, ldv_func_arg2={110680464442257309722:110680464442257309725}, ldv_func_arg2={110680464442257309722:110680464442257309725}, ldv_func_arg3={3:0}, ldv_func_arg3={3:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, tmp=0, usb_counter=0] [L3478] RET, EXPR ldv_usb_register_driver_6(driver, & __this_module, "kobil_sct") [L3478] tmp = ldv_usb_register_driver_6(driver, & __this_module, "kobil_sct") [L3479] return (tmp); VAL [\result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, driver={100:0}, driver={100:0}, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, tmp=0, usb_counter=0] [L4238] RET, EXPR usb_register(& kobil_driver) [L4238] retval = usb_register(& kobil_driver) [L4239] COND FALSE !(retval != 0) [L4244] return (0); VAL [\result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ref_cnt=0, retval=0, usb_counter=0] [L4561] RET, EXPR kobil_init() [L4561] ldv_retval_2 = kobil_init() [L4562] COND FALSE !(ldv_retval_2 != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=1, tmp___5=1, usb_counter=0] [L4567] COND TRUE ldv_retval_2 == 0 [L4568] ldv_state_variable_0 = 2 [L4569] ldv_state_variable_1 = 1 [L4570] CALL ldv_initialize_usb_serial_driver_1() [L4269] void *tmp ; [L4270] void *tmp___1 ; [L4271] void *tmp___2 ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L4273] CALL, EXPR ldv_init_zalloc(2320UL) VAL [\old(size)=2320, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3357] void *p ; [L3358] void *tmp ; [L3360] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=2320, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={36893488147419102518:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, size=2320, usb_counter=0] [L3360] tmp = calloc(1UL, size) [L3361] p = tmp VAL [\old(size)=2320, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={36893488147419102518:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={36893488147419102518:0}, ref_cnt=0, size=2320, tmp={36893488147419102518:0}, usb_counter=0] [L3362] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3362] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2320, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={36893488147419102518:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={36893488147419102518:0}, ref_cnt=0, size=2320, tmp={36893488147419102518:0}, usb_counter=0] [L3363] return (p); VAL [\old(size)=2320, \result={36893488147419102518:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={36893488147419102518:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={36893488147419102518:0}, ref_cnt=0, size=2320, tmp={36893488147419102518:0}, usb_counter=0] [L4273] RET, EXPR ldv_init_zalloc(2320UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={0:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(2320UL)={36893488147419102518:0}, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L4273] tmp = ldv_init_zalloc(2320UL) [L4274] kobil_device_group0 = (struct usb_serial_port *)tmp VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, tmp={36893488147419102518:0}, usb_counter=0] [L4275] CALL, EXPR ldv_malloc(sizeof(struct file)) VAL [\old(size)=316, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3323] void *p ; [L3324] void *tmp ; [L3325] int tmp___0 ; [L3327] tmp___0 = __VERIFIER_nondet_int() [L3328] COND TRUE tmp___0 != 0 [L3329] return ((void *)0); VAL [\old(size)=316, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, size=316, tmp___0=-2, usb_counter=0] [L4275] RET, EXPR ldv_malloc(sizeof(struct file)) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_malloc(sizeof(struct file))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, tmp={36893488147419102518:0}, usb_counter=0] [L4275] kobil_device_group1 = ldv_malloc(sizeof(struct file)) [L4276] CALL, EXPR ldv_init_zalloc(280UL) VAL [\old(size)=280, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3357] void *p ; [L3358] void *tmp ; [L3360] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=280, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-73786976294838206465:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, size=280, usb_counter=0] [L3360] tmp = calloc(1UL, size) [L3361] p = tmp VAL [\old(size)=280, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-73786976294838206465:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-73786976294838206465:0}, ref_cnt=0, size=280, tmp={-73786976294838206465:0}, usb_counter=0] [L3362] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3362] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=280, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-73786976294838206465:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-73786976294838206465:0}, ref_cnt=0, size=280, tmp={-73786976294838206465:0}, usb_counter=0] [L3363] return (p); VAL [\old(size)=280, \result={-73786976294838206465:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-73786976294838206465:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-73786976294838206465:0}, ref_cnt=0, size=280, tmp={-73786976294838206465:0}, usb_counter=0] [L4276] RET, EXPR ldv_init_zalloc(280UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={0:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(280UL)={-73786976294838206465:0}, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, tmp={36893488147419102518:0}, usb_counter=0] [L4276] tmp___1 = ldv_init_zalloc(280UL) [L4277] kobil_device_group2 = (struct usb_serial *)tmp___1 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, tmp={36893488147419102518:0}, tmp___1={-73786976294838206465:0}, usb_counter=0] [L4278] CALL, EXPR ldv_init_zalloc(2704UL) VAL [\old(size)=2704, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3357] void *p ; [L3358] void *tmp ; [L3360] EXPR, FCALL calloc(1UL, size) VAL [\old(size)=2704, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-92233720368547758081:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, size=2704, usb_counter=0] [L3360] tmp = calloc(1UL, size) [L3361] p = tmp VAL [\old(size)=2704, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-92233720368547758081:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-92233720368547758081:0}, ref_cnt=0, size=2704, tmp={-92233720368547758081:0}, usb_counter=0] [L3362] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, usb_counter=0] [L3362] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=2704, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-92233720368547758081:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-92233720368547758081:0}, ref_cnt=0, size=2704, tmp={-92233720368547758081:0}, usb_counter=0] [L3363] return (p); VAL [\old(size)=2704, \result={-92233720368547758081:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, calloc(1UL, size)={-92233720368547758081:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, p={-92233720368547758081:0}, ref_cnt=0, size=2704, tmp={-92233720368547758081:0}, usb_counter=0] [L4278] RET, EXPR ldv_init_zalloc(2704UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={0:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_init_zalloc(2704UL)={-92233720368547758081:0}, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, tmp={36893488147419102518:0}, tmp___1={-73786976294838206465:0}, usb_counter=0] [L4278] tmp___2 = ldv_init_zalloc(2704UL) [L4279] kobil_device_group3 = (struct tty_struct *)tmp___2 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ref_cnt=0, tmp={36893488147419102518:0}, tmp___1={-73786976294838206465:0}, tmp___2={-92233720368547758081:0}, usb_counter=0] [L4570] RET ldv_initialize_usb_serial_driver_1() [L4332] tmp___3 = __VERIFIER_nondet_int() [L4334] case 0: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___5=1, usb_counter=0] [L4335] COND TRUE ldv_state_variable_1 != 0 [L4336] tmp___4 = __VERIFIER_nondet_int() [L4338] case 0: [L4346] case 1: [L4356] case 2: [L4363] case 3: [L4370] case 4: [L4392] case 5: [L4402] case 6: [L4424] case 7: [L4446] case 8: [L4454] case 9: [L4476] case 10: [L4498] case 11: [L4520] case 12: [L4532] case 13: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=0, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=13, tmp___5=1, usb_counter=0] [L4533] COND TRUE ldv_state_variable_1 == 1 [L4534] CALL ldv_probe_1() [L4777] return __VERIFIER_nondet_int(); [L4534] RET ldv_probe_1() [L4535] ldv_state_variable_1 = 2 [L4536] ref_cnt = ref_cnt + 1 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=13, tmp___5=1, usb_counter=0] [L4332] tmp___3 = __VERIFIER_nondet_int() [L4334] case 0: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=13, tmp___5=1, usb_counter=0] [L4335] COND TRUE ldv_state_variable_1 != 0 [L4336] tmp___4 = __VERIFIER_nondet_int() [L4338] case 0: [L4346] case 1: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=1, tmp___5=1, usb_counter=0] [L4347] COND TRUE ldv_state_variable_1 == 2 [L4348] CALL, EXPR kobil_startup(kobil_device_group2) [L3607] int i ; [L3608] struct kobil_private *priv ; [L3609] struct usb_device *pdev ; [L3610] struct usb_host_config *actconfig ; [L3611] struct usb_interface *interface ; [L3612] struct usb_host_interface *altsetting ; [L3613] struct usb_host_endpoint *endpoint ; [L3614] void *tmp ; [L3615] int tmp___0 ; [L3616] int tmp___1 ; VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, serial={-73786976294838206465:0}, serial={-73786976294838206465:0}, usb_counter=0] [L3618] CALL, EXPR kmalloc(320UL, 208U) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3298] void *tmp___1 ; [L3300] CALL, EXPR __kmalloc(size, flags) [L3293] CALL, EXPR ldv_malloc(size) VAL [\old(size)=320, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3323] void *p ; [L3324] void *tmp ; [L3325] int tmp___0 ; [L3327] tmp___0 = __VERIFIER_nondet_int() [L3328] COND FALSE !(tmp___0 != 0) [L3331] tmp = malloc(size) [L3332] p = tmp VAL [\old(size)=320, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, p={-55340232221128654847:0}, ref_cnt=1, size=320, tmp={-55340232221128654847:0}, tmp___0=0, usb_counter=0] [L3333] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3333] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=320, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, p={-55340232221128654847:0}, ref_cnt=1, size=320, tmp={-55340232221128654847:0}, tmp___0=0, usb_counter=0] [L3334] return (p); VAL [\old(size)=320, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, p={-55340232221128654847:0}, ref_cnt=1, size=320, tmp={-55340232221128654847:0}, tmp___0=0, usb_counter=0] [L3293] RET, EXPR ldv_malloc(size) VAL [\old(size)=320, \old(t)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_malloc(size)={-55340232221128654847:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, size=320, t=208, usb_counter=0] [L3293] return ldv_malloc(size); [L3300] RET, EXPR __kmalloc(size, flags) [L3300] tmp___1 = __kmalloc(size, flags) [L3301] return (tmp___1); VAL [\old(flags)=208, \old(size)=320, \result={-55340232221128654847:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, flags=208, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, size=320, tmp___1={-55340232221128654847:0}, usb_counter=0] [L3618] RET, EXPR kmalloc(320UL, 208U) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kmalloc(320UL, 208U)={-55340232221128654847:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, ref_cnt=1, serial={-73786976294838206465:0}, serial={-73786976294838206465:0}, usb_counter=0] [L3618] tmp = kmalloc(320UL, 208U) [L3619] priv = (struct kobil_private *)tmp VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, priv={-55340232221128654847:0}, ref_cnt=1, serial={-73786976294838206465:0}, serial={-73786976294838206465:0}, tmp={-55340232221128654847:0}, usb_counter=0] [L3620] COND FALSE !((unsigned long )priv == (unsigned long )((struct kobil_private *)0)) [L3624] priv->filled = 0 [L3625] priv->cur_pos = 0 [L3626] EXPR serial->dev [L3626] EXPR (serial->dev)->descriptor.idProduct [L3626] priv->device_type = (serial->dev)->descriptor.idProduct [L3627] priv->device_type [L3628] case 8209: [L3642] EXPR serial->port[0] [L3642] CALL usb_set_serial_port_data(serial->port[0], (void *)priv) [L3529] FCALL dev_set_drvdata(& port->dev, data) [L3642] RET usb_set_serial_port_data(serial->port[0], (void *)priv) [L3643] EXPR serial->dev [L3643] pdev = serial->dev [L3644] EXPR pdev->actconfig [L3644] actconfig = pdev->actconfig [L3645] EXPR actconfig->interface[0] [L3645] interface = actconfig->interface[0] [L3646] EXPR interface->cur_altsetting [L3646] altsetting = interface->cur_altsetting [L3647] EXPR altsetting->endpoint [L3647] endpoint = altsetting->endpoint [L3648] i = 0 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, actconfig={110680464442257309733:-5}, altsetting={110680464442257309738:-13}, debug=0, endpoint={110680464442257309721:110680464442257309731}, i=0, id_table={99:0}, interface={110680464442257309715:-11}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, pdev={110680464442257309719:113}, priv={-55340232221128654847:0}, priv->device_type=73745, ref_cnt=1, serial={-73786976294838206465:0}, serial={-73786976294838206465:0}, tmp={-55340232221128654847:0}, usb_counter=0] [L3674] EXPR altsetting->desc.bNumEndpoints VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, actconfig={110680464442257309733:-5}, altsetting={110680464442257309738:-13}, altsetting->desc.bNumEndpoints=256, debug=0, endpoint={110680464442257309721:110680464442257309731}, i=0, id_table={99:0}, interface={110680464442257309715:-11}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, pdev={110680464442257309719:113}, priv={-55340232221128654847:0}, priv->device_type=73745, ref_cnt=1, serial={-73786976294838206465:0}, serial={-73786976294838206465:0}, tmp={-55340232221128654847:0}, usb_counter=0] [L3674] COND FALSE !((int )altsetting->desc.bNumEndpoints > i) [L3678] return (0); VAL [\result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, actconfig={110680464442257309733:-5}, altsetting={110680464442257309738:-13}, debug=0, endpoint={110680464442257309721:110680464442257309731}, i=0, id_table={99:0}, interface={110680464442257309715:-11}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=2, ldv_state_variable_2=1, pdev={110680464442257309719:113}, priv={-55340232221128654847:0}, priv->device_type=73745, ref_cnt=1, serial={-73786976294838206465:0}, serial={-73786976294838206465:0}, tmp={-55340232221128654847:0}, usb_counter=0] [L4348] RET, EXPR kobil_startup(kobil_device_group2) [L4348] ldv_retval_1 = kobil_startup(kobil_device_group2) [L4349] COND TRUE ldv_retval_1 == 0 [L4350] ldv_state_variable_1 = 3 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=1, tmp___5=1, usb_counter=0] [L4332] tmp___3 = __VERIFIER_nondet_int() [L4334] case 0: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=1, tmp___5=1, usb_counter=0] [L4335] COND TRUE ldv_state_variable_1 != 0 [L4336] tmp___4 = __VERIFIER_nondet_int() [L4338] case 0: [L4346] case 1: [L4356] case 2: [L4363] case 3: [L4370] case 4: [L4392] case 5: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=5, tmp___5=1, usb_counter=0] [L4393] COND TRUE ldv_state_variable_1 == 3 [L4394] CALL, EXPR kobil_open(kobil_device_group3, kobil_device_group0) [L3717] int result ; [L3718] struct kobil_private *priv ; [L3719] unsigned char *transfer_buffer ; [L3720] int transfer_buffer_length ; [L3721] int write_urb_transfer_buffer_length ; [L3722] void *tmp ; [L3723] void *tmp___0 ; [L3724] unsigned int tmp___1 ; [L3725] unsigned int tmp___2 ; [L3726] unsigned int tmp___3 ; [L3727] unsigned int tmp___4 ; [L3729] result = 0 [L3730] transfer_buffer_length = 8 [L3731] write_urb_transfer_buffer_length = 8 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, ref_cnt=1, result=0, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3732] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, ref_cnt=1, result=0, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3737] CALL, EXPR usb_get_serial_port_data(port) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3520] void *tmp ; [L3522] CALL, EXPR dev_get_drvdata((struct device const *)(& port->dev)) [L4759] CALL, EXPR ldv_malloc(0UL) VAL [\old(size)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3323] void *p ; [L3324] void *tmp ; [L3325] int tmp___0 ; [L3327] tmp___0 = __VERIFIER_nondet_int() [L3328] COND TRUE tmp___0 != 0 [L3329] return ((void *)0); VAL [\old(size)=0, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=0, tmp___0=-6, usb_counter=0] [L4759] RET, EXPR ldv_malloc(0UL) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, arg0={36893488147419102518:1064}, arg0={36893488147419102518:1064}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_malloc(0UL)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4759] return ldv_malloc(0UL); [L3522] RET, EXPR dev_get_drvdata((struct device const *)(& port->dev)) [L3522] tmp = dev_get_drvdata((struct device const *)(& port->dev)) [L3523] return (tmp); VAL [\result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, ref_cnt=1, tmp={0:0}, usb_counter=0] [L3737] RET, EXPR usb_get_serial_port_data(port) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, ref_cnt=1, result=0, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, usb_get_serial_port_data(port)={0:0}, write_urb_transfer_buffer_length=8] [L3737] tmp = usb_get_serial_port_data(port) [L3738] priv = (struct kobil_private *)tmp [L3739] EXPR port->interrupt_in_urb [L3739] EXPR port->serial [L3739] EXPR (port->serial)->dev [L3739] (port->interrupt_in_urb)->dev = (port->serial)->dev [L3740] CALL, EXPR kzalloc((size_t )transfer_buffer_length, 208U) VAL [\old(flags)=208, \old(size)=8, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3307] void *tmp ; VAL [\old(flags)=208, \old(size)=8, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, flags=208, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=8, usb_counter=0] [L3309] CALL, EXPR kmalloc(size, flags | 32768U) VAL [\old(size)=8, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3298] void *tmp___1 ; [L3300] CALL, EXPR __kmalloc(size, flags) [L3293] CALL, EXPR ldv_malloc(size) VAL [\old(size)=8, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3323] void *p ; [L3324] void *tmp ; [L3325] int tmp___0 ; [L3327] tmp___0 = __VERIFIER_nondet_int() [L3328] COND FALSE !(tmp___0 != 0) [L3331] tmp = malloc(size) [L3332] p = tmp VAL [\old(size)=8, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, p={-18446744073709551615:0}, ref_cnt=1, size=8, tmp={-18446744073709551615:0}, tmp___0=0, usb_counter=0] [L3333] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3319] COND FALSE !(!cond) VAL [\old(cond)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, cond=1, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3333] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [\old(size)=8, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, p={-18446744073709551615:0}, ref_cnt=1, size=8, tmp={-18446744073709551615:0}, tmp___0=0, usb_counter=0] [L3334] return (p); VAL [\old(size)=8, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, p={-18446744073709551615:0}, ref_cnt=1, size=8, tmp={-18446744073709551615:0}, tmp___0=0, usb_counter=0] [L3293] RET, EXPR ldv_malloc(size) VAL [\old(size)=8, \old(t)=39, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_malloc(size)={-18446744073709551615:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=8, t=39, usb_counter=0] [L3293] return ldv_malloc(size); [L3300] RET, EXPR __kmalloc(size, flags) [L3300] tmp___1 = __kmalloc(size, flags) [L3301] return (tmp___1); VAL [\old(flags)=39, \old(size)=8, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, flags=39, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=8, tmp___1={-18446744073709551615:0}, usb_counter=0] [L3309] RET, EXPR kmalloc(size, flags | 32768U) VAL [\old(flags)=208, \old(size)=8, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, flags=208, id_table={99:0}, kmalloc(size, flags | 32768U)={-18446744073709551615:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=8, usb_counter=0] [L3309] tmp = kmalloc(size, flags | 32768U) [L3310] return (tmp); VAL [\old(flags)=208, \old(size)=8, \result={-18446744073709551615:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, flags=208, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=8, tmp={-18446744073709551615:0}, usb_counter=0] [L3740] RET, EXPR kzalloc((size_t )transfer_buffer_length, 208U) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, kzalloc((size_t )transfer_buffer_length, 208U)={-18446744073709551615:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3740] tmp___0 = kzalloc((size_t )transfer_buffer_length, 208U) [L3741] transfer_buffer = (unsigned char *)tmp___0 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3742] COND FALSE !((unsigned long )transfer_buffer == (unsigned long )((unsigned char *)0U)) [L3746] EXPR port->write_urb VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->write_urb={36893488147419102518:713}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3746] COND FALSE !((unsigned long )port->write_urb == (unsigned long )((struct urb *)0)) [L3765] EXPR port->write_urb VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->write_urb={36893488147419102518:713}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3765-L3766] CALL, EXPR kmalloc((size_t )write_urb_transfer_buffer_length, 208U) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3298] void *tmp___1 ; [L3300] CALL, EXPR __kmalloc(size, flags) [L3293] CALL, EXPR ldv_malloc(size) VAL [\old(size)=8, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3323] void *p ; [L3324] void *tmp ; [L3325] int tmp___0 ; [L3327] tmp___0 = __VERIFIER_nondet_int() [L3328] COND TRUE tmp___0 != 0 [L3329] return ((void *)0); VAL [\old(size)=8, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=8, tmp___0=-7, usb_counter=0] [L3293] RET, EXPR ldv_malloc(size) VAL [\old(size)=8, \old(t)=208, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_malloc(size)={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=8, t=208, usb_counter=0] [L3293] return ldv_malloc(size); [L3300] RET, EXPR __kmalloc(size, flags) [L3300] tmp___1 = __kmalloc(size, flags) [L3301] return (tmp___1); VAL [\old(flags)=208, \old(size)=8, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, flags=208, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, size=8, tmp___1={0:0}, usb_counter=0] [L3765-L3766] RET, EXPR kmalloc((size_t )write_urb_transfer_buffer_length, 208U) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kmalloc((size_t )write_urb_transfer_buffer_length, 208U)={0:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->write_urb={36893488147419102518:713}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3765-L3766] (port->write_urb)->transfer_buffer = kmalloc((size_t )write_urb_transfer_buffer_length, 208U) [L3767] EXPR port->write_urb [L3767] EXPR (port->write_urb)->transfer_buffer VAL [(port->write_urb)->transfer_buffer={36893488147419103233:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->write_urb={0:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3767] COND FALSE !((unsigned long )(port->write_urb)->transfer_buffer == (unsigned long )((void *)0)) [L3774] EXPR port->serial [L3774] EXPR (port->serial)->dev VAL [(port->serial)->dev={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->serial={36893488147419102518:809}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3774] CALL, EXPR __create_pipe((port->serial)->dev, 0U) VAL [\old(endpoint)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, dev={0:0}, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3515] EXPR dev->devnum [L3515] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3774] RET, EXPR __create_pipe((port->serial)->dev, 0U) VAL [(port->serial)->dev={0:0}, __create_pipe((port->serial)->dev, 0U)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->serial={36893488147419102518:809}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3774] tmp___1 = __create_pipe((port->serial)->dev, 0U) [L3775] EXPR port->serial [L3775] EXPR (port->serial)->dev VAL [(port->serial)->dev={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->serial={36893488147419102518:809}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3775-L3777] CALL, EXPR usb_control_msg((port->serial)->dev, tmp___1 | 2147483776U, 16, 194, 2, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500) VAL [\old(arg2)=16, \old(arg3)=194, \old(arg4)=2, \old(arg5)=0, \old(arg7)=8, \old(arg8)=500, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, arg0={0:0}, arg6={-18446744073709551615:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4815] return __VERIFIER_nondet_int(); [L3775-L3777] RET, EXPR usb_control_msg((port->serial)->dev, tmp___1 | 2147483776U, 16, 194, 2, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500) VAL [(port->serial)->dev={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->serial={36893488147419102518:809}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_control_msg((port->serial)->dev, tmp___1 | 2147483776U, 16, 194, 2, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500)=0, usb_counter=0, write_urb_transfer_buffer_length=8] [L3775-L3777] result = usb_control_msg((port->serial)->dev, tmp___1 | 2147483776U, 16, 194, 2, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500) [L3778] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3783] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3788] EXPR port->serial [L3788] EXPR (port->serial)->dev VAL [(port->serial)->dev={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->serial={36893488147419102518:809}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3788] CALL, EXPR __create_pipe((port->serial)->dev, 0U) VAL [\old(endpoint)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, dev={0:0}, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3515] EXPR dev->devnum [L3515] return ((unsigned int )(dev->devnum << 8) | (endpoint << 15)); [L3788] RET, EXPR __create_pipe((port->serial)->dev, 0U) VAL [(port->serial)->dev={0:0}, __create_pipe((port->serial)->dev, 0U)=1, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->serial={36893488147419102518:809}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3788] tmp___2 = __create_pipe((port->serial)->dev, 0U) [L3789] EXPR port->serial [L3789] EXPR (port->serial)->dev VAL [(port->serial)->dev={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->serial={36893488147419102518:809}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3789-L3791] CALL, EXPR usb_control_msg((port->serial)->dev, tmp___2 | 2147483776U, 16, 194, 1, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500) VAL [\old(arg2)=16, \old(arg3)=194, \old(arg4)=1, \old(arg5)=0, \old(arg7)=8, \old(arg8)=500, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, arg0={0:0}, arg6={-18446744073709551615:0}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4815] return __VERIFIER_nondet_int(); [L3789-L3791] RET, EXPR usb_control_msg((port->serial)->dev, tmp___2 | 2147483776U, 16, 194, 1, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500) VAL [(port->serial)->dev={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, port->serial={36893488147419102518:809}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_control_msg((port->serial)->dev, tmp___2 | 2147483776U, 16, 194, 1, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500)=0, usb_counter=0, write_urb_transfer_buffer_length=8] [L3789-L3791] result = usb_control_msg((port->serial)->dev, tmp___2 | 2147483776U, 16, 194, 1, 0, (void *)transfer_buffer, (int )((__u16 )transfer_buffer_length), 500) [L3792] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3797] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3802] EXPR priv->device_type [L3802] (unsigned int )priv->device_type == 8209U || (unsigned int )priv->device_type == 8210U [L3802] EXPR priv->device_type [L3802] (unsigned int )priv->device_type == 8209U || (unsigned int )priv->device_type == 8210U VAL [(unsigned int )priv->device_type == 8209U || (unsigned int )priv->device_type == 8210U=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, priv->device_type=115, priv->device_type=115, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3802] COND FALSE !((unsigned int )priv->device_type == 8209U || (unsigned int )priv->device_type == 8210U) [L3821] EXPR priv->device_type [L3821] EXPR (unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U [L3821] EXPR priv->device_type [L3821] EXPR (unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U VAL [(unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, priv->device_type=115, priv->device_type=115, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3821] ((unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U) || (unsigned int )priv->device_type == 129U [L3821] EXPR priv->device_type [L3821] ((unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U) || (unsigned int )priv->device_type == 129U VAL [((unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U) || (unsigned int )priv->device_type == 129U=0, (unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, priv->device_type=115, priv->device_type=115, priv->device_type=115, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3821] COND FALSE !(((unsigned int )priv->device_type == 120U || (unsigned int )priv->device_type == 8209U) || (unsigned int )priv->device_type == 129U) [L3830] CALL kfree((void const *)transfer_buffer) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, p={-18446744073709551615:0}, ref_cnt=1, usb_counter=0] [L3830] RET kfree((void const *)transfer_buffer) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L3831] return (0); VAL [\result=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=3, ldv_state_variable_2=1, port={36893488147419102518:0}, port={36893488147419102518:0}, priv={0:0}, ref_cnt=1, result=0, tmp={0:0}, tmp___0={-18446744073709551615:0}, tmp___1=1, tmp___2=1, transfer_buffer={-18446744073709551615:0}, transfer_buffer_length=8, tty={-92233720368547758081:0}, tty={-92233720368547758081:0}, usb_counter=0, write_urb_transfer_buffer_length=8] [L4394] RET, EXPR kobil_open(kobil_device_group3, kobil_device_group0) [L4394] ldv_retval_0 = kobil_open(kobil_device_group3, kobil_device_group0) [L4395] COND TRUE ldv_retval_0 == 0 [L4396] ldv_state_variable_1 = 4 VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=5, tmp___5=1, usb_counter=0] [L4332] tmp___3 = __VERIFIER_nondet_int() [L4334] case 0: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=5, tmp___5=1, usb_counter=0] [L4335] COND TRUE ldv_state_variable_1 != 0 [L4336] tmp___4 = __VERIFIER_nondet_int() [L4338] case 0: [L4346] case 1: [L4356] case 2: VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ldvarg0={110680464442257309699:0}, ldvarg1={110680464442257309709:0}, ldvarg2={110680464442257309713:0}, ldvarg3={110680464442257309711:0}, ldvarg4={92233720368547758081:0}, ldvarg5={-18446744073709551617:0}, ldvarg6={110680464442257309714:0}, ldvarg7={18446744073709551617:0}, ldvarg8={-36893488147419103233:0}, ref_cnt=1, tmp={18446744073709551617:0}, tmp___0={-18446744073709551617:0}, tmp___1={92233720368547758081:0}, tmp___2={-36893488147419103233:0}, tmp___3=0, tmp___4=2, tmp___5=1, usb_counter=0] [L4357] COND TRUE ldv_state_variable_1 == 4 [L4358] CALL kobil_read_int_callback(ldvarg5) [L3855] int result ; [L3856] struct usb_serial_port *port ; [L3857] struct tty_struct *tty ; [L3858] unsigned char *data ; [L3859] int status ; [L3861] EXPR urb->context [L3861] port = (struct usb_serial_port *)urb->context [L3862] EXPR urb->transfer_buffer [L3862] data = (unsigned char *)urb->transfer_buffer [L3863] EXPR urb->status [L3863] status = urb->status [L3864] COND FALSE !(debug != 0) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, data={110680464442257309724:110680464442257309718}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, port={110680464442257309736:-16}, ref_cnt=1, status=0, urb={-18446744073709551617:0}, urb={-18446744073709551617:0}, usb_counter=0] [L3869] COND FALSE !(status != 0) [L3878] CALL, EXPR ldv_tty_port_tty_get_7(& port->port) [L4669] ldv_func_ret_type___1 ldv_func_res ; [L4670] struct tty_struct *tmp ; [L4672] CALL, EXPR tty_port_tty_get(ldv_func_arg1) [L4808] CALL, EXPR ldv_malloc(sizeof(struct tty_struct)) VAL [\old(size)=2516, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L3323] void *p ; [L3324] void *tmp ; [L3325] int tmp___0 ; [L3327] tmp___0 = __VERIFIER_nondet_int() [L3328] COND TRUE tmp___0 != 0 [L3329] return ((void *)0); VAL [\old(size)=2516, \result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, size=2516, tmp___0=-12, usb_counter=0] [L4808] RET, EXPR ldv_malloc(sizeof(struct tty_struct)) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, arg0={110680464442257309736:-8}, arg0={110680464442257309736:-8}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={-36893488147419103231:0}, ldv_malloc(sizeof(struct tty_struct))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4808] return ldv_malloc(sizeof(struct tty_struct)); [L4672] RET, EXPR tty_port_tty_get(ldv_func_arg1) [L4672] tmp = tty_port_tty_get(ldv_func_arg1) [L4673] ldv_func_res = tmp [L4674] CALL ldv_got_tty(ldv_func_res) [L4744] ldv_latest_tty = tty VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, tty={0:0}, tty={0:0}, usb_counter=0] [L4674] RET ldv_got_tty(ldv_func_res) [L4675] return (ldv_func_res); VAL [\result={0:0}, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, ldv_func_arg1={110680464442257309736:-8}, ldv_func_arg1={110680464442257309736:-8}, ldv_func_res={0:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, tmp={0:0}, usb_counter=0] [L3878] RET, EXPR ldv_tty_port_tty_get_7(& port->port) [L3878] tty = ldv_tty_port_tty_get_7(& port->port) [L3879] EXPR urb->actual_length VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, data={110680464442257309724:110680464442257309718}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, port={110680464442257309736:-16}, ref_cnt=1, status=0, tty={0:0}, urb={-18446744073709551617:0}, urb={-18446744073709551617:0}, urb->actual_length=-4294967297, usb_counter=0] [L3879] COND TRUE urb->actual_length != 0U [L3880] EXPR urb->actual_length [L3880] CALL tty_insert_flip_string(tty, (unsigned char const *)data, (size_t )urb->actual_length) [L4636] int tmp ; VAL [\old(size)=4294967295, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, a={0:0}, a={0:0}, chars={110680464442257309724:110680464442257309718}, chars={110680464442257309724:110680464442257309718}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, size=4294967295, usb_counter=0] [L4638] CALL ldv_check_tty(a) VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] [L4751] COND TRUE (unsigned long )tty == (unsigned long )ldv_latest_tty && (unsigned long )tty == (unsigned long )((struct tty_struct *)0) [L4752] CALL ldv_error() [L4715] reach_error() VAL [__mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __this_module={110680464442257309722:110680464442257309725}, debug=0, id_table={99:0}, kobil_device={101:0}, kobil_device_group0={36893488147419102518:0}, kobil_device_group1={0:0}, kobil_device_group2={-73786976294838206465:0}, kobil_device_group3={-92233720368547758081:0}, kobil_driver={100:0}, kobil_driver_group1={-55340232221128654849:0}, LDV_IN_INTERRUPT=1, ldv_latest_tty={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_state_variable_0=2, ldv_state_variable_1=4, ldv_state_variable_2=1, ref_cnt=1, usb_counter=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 600 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 116.7s, OverallIterations: 21, TraceHistogramMax: 24, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 93.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 17025 SdHoareTripleChecker+Valid, 88.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16386 mSDsluCounter, 76202 SdHoareTripleChecker+Invalid, 84.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57184 mSDsCounter, 8615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22190 IncrementalHoareTripleChecker+Invalid, 30832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8615 mSolverCounterUnsat, 19018 mSDtfsCounter, 22190 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5045 GetRequests, 4795 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5500occurred in iteration=20, InterpolantAutomatonStates: 184, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 18853 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 7.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 8769 NumberOfCodeBlocks, 8612 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 9103 ConstructedInterpolants, 0 QuantifiedInterpolants, 14096 SizeOfPredicates, 38 NumberOfNonLiveVariables, 21349 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 29 InterpolantComputations, 18 PerfectInterpolantSequences, 15670/15882 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-14 00:47:19,852 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-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.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 1bad5b7f91b61cdf9d4f1ace01330b8d7c80f8ede0ca40c43d18f706f54101eb --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 00:47:21,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 00:47:21,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 00:47:21,516 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 00:47:21,517 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 00:47:21,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 00:47:21,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 00:47:21,524 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 00:47:21,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 00:47:21,529 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 00:47:21,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 00:47:21,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 00:47:21,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 00:47:21,536 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 00:47:21,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 00:47:21,538 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 00:47:21,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 00:47:21,540 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 00:47:21,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 00:47:21,542 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 00:47:21,543 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 00:47:21,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 00:47:21,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 00:47:21,544 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 00:47:21,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 00:47:21,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 00:47:21,552 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 00:47:21,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 00:47:21,553 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 00:47:21,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 00:47:21,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 00:47:21,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 00:47:21,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 00:47:21,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 00:47:21,557 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 00:47:21,558 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 00:47:21,558 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 00:47:21,559 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 00:47:21,559 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 00:47:21,559 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 00:47:21,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 00:47:21,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 00:47:21,561 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-14 00:47:21,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 00:47:21,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 00:47:21,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 00:47:21,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 00:47:21,594 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 00:47:21,594 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 00:47:21,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 00:47:21,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 00:47:21,595 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 00:47:21,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 00:47:21,596 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 00:47:21,596 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 00:47:21,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 00:47:21,597 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 00:47:21,597 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 00:47:21,597 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 00:47:21,597 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 00:47:21,597 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 00:47:21,597 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 00:47:21,598 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 00:47:21,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 00:47:21,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 00:47:21,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 00:47:21,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:47:21,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 00:47:21,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 00:47:21,599 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 00:47:21,599 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 00:47:21,599 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 00:47:21,599 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 00:47:21,600 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 00:47:21,600 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 00:47:21,600 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 00:47:21,600 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 -> 1bad5b7f91b61cdf9d4f1ace01330b8d7c80f8ede0ca40c43d18f706f54101eb [2022-07-14 00:47:21,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 00:47:21,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 00:47:21,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 00:47:21,889 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 00:47:21,890 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 00:47:21,891 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:47:21,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ec0d2e3/8d6e2ca2cd5c4b899bc6dccc6a56963a/FLAG892dc0488 [2022-07-14 00:47:22,512 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 00:47:22,513 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:47:22,533 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ec0d2e3/8d6e2ca2cd5c4b899bc6dccc6a56963a/FLAG892dc0488 [2022-07-14 00:47:22,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0ec0d2e3/8d6e2ca2cd5c4b899bc6dccc6a56963a [2022-07-14 00:47:22,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 00:47:22,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 00:47:22,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 00:47:22,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 00:47:22,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 00:47:22,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:47:22" (1/1) ... [2022-07-14 00:47:22,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57902f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:22, skipping insertion in model container [2022-07-14 00:47:22,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 12:47:22" (1/1) ... [2022-07-14 00:47:22,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 00:47:23,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:47:23,741 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-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i[144238,144251] [2022-07-14 00:47:23,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:47:23,783 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-14 00:47:23,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 00:47:23,919 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-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i[144238,144251] [2022-07-14 00:47:23,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:47:23,951 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 00:47:24,123 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-validator-v0.8/linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i[144238,144251] [2022-07-14 00:47:24,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 00:47:24,163 INFO L208 MainTranslator]: Completed translation [2022-07-14 00:47:24,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24 WrapperNode [2022-07-14 00:47:24,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 00:47:24,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 00:47:24,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 00:47:24,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 00:47:24,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,200 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,278 INFO L137 Inliner]: procedures = 130, calls = 787, calls flagged for inlining = 53, calls inlined = 52, statements flattened = 1849 [2022-07-14 00:47:24,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 00:47:24,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 00:47:24,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 00:47:24,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 00:47:24,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,400 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 00:47:24,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 00:47:24,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 00:47:24,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 00:47:24,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (1/1) ... [2022-07-14 00:47:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 00:47:24,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 00:47:24,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 00:47:24,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 00:47:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-14 00:47:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2022-07-14 00:47:24,472 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2022-07-14 00:47:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-14 00:47:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 00:47:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 00:47:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-14 00:47:24,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 00:47:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 00:47:24,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 00:47:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 00:47:24,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 00:47:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2022-07-14 00:47:24,473 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2022-07-14 00:47:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 00:47:24,473 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 00:47:24,473 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 00:47:24,474 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 00:47:24,474 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 00:47:24,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 00:47:24,474 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 00:47:24,474 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 00:47:24,474 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 00:47:24,474 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 00:47:24,474 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_serial_port_data [2022-07-14 00:47:24,474 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_serial_port_data [2022-07-14 00:47:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-14 00:47:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-14 00:47:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-14 00:47:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-14 00:47:24,475 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_tty [2022-07-14 00:47:24,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_tty [2022-07-14 00:47:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2022-07-14 00:47:24,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2022-07-14 00:47:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-14 00:47:24,476 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-14 00:47:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_detach_1 [2022-07-14 00:47:24,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_detach_1 [2022-07-14 00:47:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 00:47:24,476 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2022-07-14 00:47:24,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2022-07-14 00:47:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 00:47:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_tiocmset [2022-07-14 00:47:24,477 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_tiocmset [2022-07-14 00:47:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_tiocmget [2022-07-14 00:47:24,477 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_tiocmget [2022-07-14 00:47:24,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 00:47:24,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 00:47:24,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-14 00:47:24,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-14 00:47:24,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-14 00:47:24,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 00:47:24,479 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_ioctl [2022-07-14 00:47:24,480 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_ioctl [2022-07-14 00:47:24,480 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-14 00:47:24,480 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-14 00:47:24,480 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-07-14 00:47:24,480 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-07-14 00:47:24,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-14 00:47:24,481 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_write_room [2022-07-14 00:47:24,481 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_write_room [2022-07-14 00:47:24,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-14 00:47:24,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 00:47:24,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 00:47:24,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 00:47:24,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-14 00:47:24,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 00:47:24,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-14 00:47:24,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-14 00:47:24,482 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_init_termios [2022-07-14 00:47:24,482 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_init_termios [2022-07-14 00:47:24,482 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2022-07-14 00:47:24,482 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2022-07-14 00:47:24,482 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 00:47:24,482 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 00:47:24,483 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-14 00:47:24,483 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-14 00:47:24,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-14 00:47:24,483 INFO L130 BoogieDeclarations]: Found specification of procedure kobil_set_termios [2022-07-14 00:47:24,483 INFO L138 BoogieDeclarations]: Found implementation of procedure kobil_set_termios [2022-07-14 00:47:24,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 00:47:24,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 00:47:24,875 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 00:47:24,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 00:47:25,122 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 00:47:40,208 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 00:47:40,217 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 00:47:40,217 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 00:47:40,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:47:40 BoogieIcfgContainer [2022-07-14 00:47:40,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 00:47:40,220 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 00:47:40,220 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 00:47:40,222 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 00:47:40,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 12:47:22" (1/3) ... [2022-07-14 00:47:40,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9445e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:47:40, skipping insertion in model container [2022-07-14 00:47:40,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 12:47:24" (2/3) ... [2022-07-14 00:47:40,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9445e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 12:47:40, skipping insertion in model container [2022-07-14 00:47:40,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 12:47:40" (3/3) ... [2022-07-14 00:47:40,224 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-1dfa93a-1-100_1a-drivers--usb--serial--kobil_sct.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-07-14 00:47:40,233 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 00:47:40,233 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-14 00:47:40,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 00:47:40,290 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@177618d0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c56a9d1 [2022-07-14 00:47:40,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-14 00:47:40,295 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 446 states have (on average 1.4103139013452914) internal successors, (629), 453 states have internal predecessors, (629), 114 states have call successors, (114), 26 states have call predecessors, (114), 25 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) [2022-07-14 00:47:40,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 00:47:40,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:40,320 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:47:40,321 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1370803934, now seen corresponding path program 1 times [2022-07-14 00:47:40,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:47:40,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519559072] [2022-07-14 00:47:40,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:47:40,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:47:40,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:47:40,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:47:40,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 00:47:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:40,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 00:47:40,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:47:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-07-14 00:47:40,916 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:47:40,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:47:40,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519559072] [2022-07-14 00:47:40,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519559072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:47:40,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:47:40,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 00:47:40,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683946176] [2022-07-14 00:47:40,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:47:40,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 00:47:40,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:47:40,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 00:47:40,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 00:47:40,940 INFO L87 Difference]: Start difference. First operand has 587 states, 446 states have (on average 1.4103139013452914) internal successors, (629), 453 states have internal predecessors, (629), 114 states have call successors, (114), 26 states have call predecessors, (114), 25 states have return successors, (109), 109 states have call predecessors, (109), 109 states have call successors, (109) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:47:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:47:40,989 INFO L93 Difference]: Finished difference Result 1170 states and 1751 transitions. [2022-07-14 00:47:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 00:47:40,991 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2022-07-14 00:47:40,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:47:41,005 INFO L225 Difference]: With dead ends: 1170 [2022-07-14 00:47:41,007 INFO L226 Difference]: Without dead ends: 571 [2022-07-14 00:47:41,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 00:47:41,020 INFO L413 NwaCegarLoop]: 849 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 00:47:41,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 00:47:41,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-14 00:47:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2022-07-14 00:47:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 437 states have (on average 1.3981693363844394) internal successors, (611), 438 states have internal predecessors, (611), 108 states have call successors, (108), 25 states have call predecessors, (108), 25 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2022-07-14 00:47:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 827 transitions. [2022-07-14 00:47:41,095 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 827 transitions. Word has length 128 [2022-07-14 00:47:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:47:41,095 INFO L495 AbstractCegarLoop]: Abstraction has 571 states and 827 transitions. [2022-07-14 00:47:41,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 00:47:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 827 transitions. [2022-07-14 00:47:41,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 00:47:41,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:41,108 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:47:41,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 00:47:41,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:47:41,328 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:41,329 INFO L85 PathProgramCache]: Analyzing trace with hash 948643174, now seen corresponding path program 1 times [2022-07-14 00:47:41,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:47:41,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234714194] [2022-07-14 00:47:41,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:47:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:47:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:47:41,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:47:41,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 00:47:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:41,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 00:47:41,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:47:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-14 00:47:42,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:47:42,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:47:42,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234714194] [2022-07-14 00:47:42,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [234714194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:47:42,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:47:42,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 00:47:42,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286339291] [2022-07-14 00:47:42,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:47:42,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 00:47:42,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:47:42,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 00:47:42,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:47:42,665 INFO L87 Difference]: Start difference. First operand 571 states and 827 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-14 00:47:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:47:43,375 INFO L93 Difference]: Finished difference Result 1139 states and 1655 transitions. [2022-07-14 00:47:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:47:43,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 128 [2022-07-14 00:47:43,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:47:43,380 INFO L225 Difference]: With dead ends: 1139 [2022-07-14 00:47:43,380 INFO L226 Difference]: Without dead ends: 573 [2022-07-14 00:47:43,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:47:43,382 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 2 mSDsluCounter, 4085 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4907 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:47:43,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4907 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:47:43,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-07-14 00:47:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2022-07-14 00:47:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 438 states have (on average 1.3972602739726028) internal successors, (612), 440 states have internal predecessors, (612), 108 states have call successors, (108), 25 states have call predecessors, (108), 26 states have return successors, (114), 108 states have call predecessors, (114), 108 states have call successors, (114) [2022-07-14 00:47:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 834 transitions. [2022-07-14 00:47:43,407 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 834 transitions. Word has length 128 [2022-07-14 00:47:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:47:43,408 INFO L495 AbstractCegarLoop]: Abstraction has 573 states and 834 transitions. [2022-07-14 00:47:43,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-07-14 00:47:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 834 transitions. [2022-07-14 00:47:43,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-14 00:47:43,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:43,414 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 00:47:43,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 00:47:43,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:47:43,633 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:43,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1579561543, now seen corresponding path program 1 times [2022-07-14 00:47:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:47:43,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637934245] [2022-07-14 00:47:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:47:43,634 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:47:43,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:47:43,636 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:47:43,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 00:47:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:44,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 00:47:44,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:47:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2022-07-14 00:47:44,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:47:44,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:47:44,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637934245] [2022-07-14 00:47:44,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637934245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:47:44,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:47:44,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:47:44,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258627759] [2022-07-14 00:47:44,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:47:44,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:47:44,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:47:44,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:47:44,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:47:44,680 INFO L87 Difference]: Start difference. First operand 573 states and 834 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:47:45,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:47:45,243 INFO L93 Difference]: Finished difference Result 1155 states and 1669 transitions. [2022-07-14 00:47:45,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 00:47:45,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2022-07-14 00:47:45,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:47:45,247 INFO L225 Difference]: With dead ends: 1155 [2022-07-14 00:47:45,247 INFO L226 Difference]: Without dead ends: 593 [2022-07-14 00:47:45,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 00:47:45,249 INFO L413 NwaCegarLoop]: 829 mSDtfsCounter, 39 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 3281 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:47:45,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 3281 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:47:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-14 00:47:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 591. [2022-07-14 00:47:45,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 450 states have (on average 1.3866666666666667) internal successors, (624), 451 states have internal predecessors, (624), 111 states have call successors, (111), 29 states have call predecessors, (111), 29 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-14 00:47:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 846 transitions. [2022-07-14 00:47:45,275 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 846 transitions. Word has length 134 [2022-07-14 00:47:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:47:45,275 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 846 transitions. [2022-07-14 00:47:45,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:47:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 846 transitions. [2022-07-14 00:47:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-14 00:47:45,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:45,277 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 00:47:45,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 00:47:45,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:47:45,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:45,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -356464088, now seen corresponding path program 2 times [2022-07-14 00:47:45,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:47:45,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816330454] [2022-07-14 00:47:45,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:47:45,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:47:45,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:47:45,500 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:47:45,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 00:47:53,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:47:53,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:47:53,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 00:47:53,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:47:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-14 00:47:53,876 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:47:53,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:47:53,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816330454] [2022-07-14 00:47:53,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816330454] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:47:53,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:47:53,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:47:53,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036353969] [2022-07-14 00:47:53,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:47:53,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:47:53,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:47:53,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:47:53,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:47:53,877 INFO L87 Difference]: Start difference. First operand 591 states and 846 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:47:54,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:47:54,201 INFO L93 Difference]: Finished difference Result 1149 states and 1658 transitions. [2022-07-14 00:47:54,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 00:47:54,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2022-07-14 00:47:54,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:47:54,205 INFO L225 Difference]: With dead ends: 1149 [2022-07-14 00:47:54,205 INFO L226 Difference]: Without dead ends: 592 [2022-07-14 00:47:54,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:47:54,207 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 3 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2464 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:47:54,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2464 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:47:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-14 00:47:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-07-14 00:47:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 451 states have (on average 1.3858093126385809) internal successors, (625), 452 states have internal predecessors, (625), 111 states have call successors, (111), 29 states have call predecessors, (111), 29 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-14 00:47:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 847 transitions. [2022-07-14 00:47:54,223 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 847 transitions. Word has length 140 [2022-07-14 00:47:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:47:54,223 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 847 transitions. [2022-07-14 00:47:54,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:47:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 847 transitions. [2022-07-14 00:47:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-14 00:47:54,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:54,225 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 00:47:54,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 00:47:54,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:47:54,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:54,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:54,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2069020180, now seen corresponding path program 1 times [2022-07-14 00:47:54,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:47:54,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667167738] [2022-07-14 00:47:54,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:47:54,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:47:54,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:47:54,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:47:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 00:47:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:47:55,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 00:47:55,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:47:55,438 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 00:47:55,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:47:56,348 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2022-07-14 00:47:56,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:47:56,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667167738] [2022-07-14 00:47:56,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667167738] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:47:56,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:47:56,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-14 00:47:56,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516883991] [2022-07-14 00:47:56,350 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:47:56,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:47:56,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:47:56,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:47:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:47:56,351 INFO L87 Difference]: Start difference. First operand 592 states and 847 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:47:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:47:57,686 INFO L93 Difference]: Finished difference Result 1160 states and 1676 transitions. [2022-07-14 00:47:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 00:47:57,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 145 [2022-07-14 00:47:57,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:47:57,693 INFO L225 Difference]: With dead ends: 1160 [2022-07-14 00:47:57,694 INFO L226 Difference]: Without dead ends: 602 [2022-07-14 00:47:57,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-07-14 00:47:57,697 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 19 mSDsluCounter, 1643 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2467 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:47:57,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2467 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:47:57,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2022-07-14 00:47:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2022-07-14 00:47:57,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 460 states have (on average 1.3847826086956523) internal successors, (637), 461 states have internal predecessors, (637), 111 states have call successors, (111), 30 states have call predecessors, (111), 30 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-14 00:47:57,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 859 transitions. [2022-07-14 00:47:57,719 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 859 transitions. Word has length 145 [2022-07-14 00:47:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:47:57,720 INFO L495 AbstractCegarLoop]: Abstraction has 602 states and 859 transitions. [2022-07-14 00:47:57,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:47:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 859 transitions. [2022-07-14 00:47:57,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-14 00:47:57,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:47:57,722 INFO L195 NwaCegarLoop]: trace histogram [18, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 00:47:57,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 00:47:57,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:47:57,942 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:47:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:47:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1191971032, now seen corresponding path program 2 times [2022-07-14 00:47:57,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:47:57,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166131283] [2022-07-14 00:47:57,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:47:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:47:57,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:47:57,947 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:47:57,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 00:48:06,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 00:48:06,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:48:06,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 1328 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 00:48:06,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:48:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 80 proven. 3 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2022-07-14 00:48:07,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:48:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2022-07-14 00:48:08,823 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:48:08,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166131283] [2022-07-14 00:48:08,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166131283] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:48:08,824 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:48:08,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-14 00:48:08,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938435241] [2022-07-14 00:48:08,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:48:08,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 00:48:08,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:48:08,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 00:48:08,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 00:48:08,825 INFO L87 Difference]: Start difference. First operand 602 states and 859 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 00:48:11,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:48:11,369 INFO L93 Difference]: Finished difference Result 1153 states and 1659 transitions. [2022-07-14 00:48:11,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 00:48:11,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2022-07-14 00:48:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:48:11,374 INFO L225 Difference]: With dead ends: 1153 [2022-07-14 00:48:11,374 INFO L226 Difference]: Without dead ends: 606 [2022-07-14 00:48:11,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2022-07-14 00:48:11,379 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 36 mSDsluCounter, 2454 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 00:48:11,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 3274 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-14 00:48:11,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-07-14 00:48:11,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2022-07-14 00:48:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 464 states have (on average 1.3771551724137931) internal successors, (639), 465 states have internal predecessors, (639), 111 states have call successors, (111), 30 states have call predecessors, (111), 30 states have return successors, (111), 111 states have call predecessors, (111), 111 states have call successors, (111) [2022-07-14 00:48:11,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 861 transitions. [2022-07-14 00:48:11,394 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 861 transitions. Word has length 158 [2022-07-14 00:48:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:48:11,395 INFO L495 AbstractCegarLoop]: Abstraction has 606 states and 861 transitions. [2022-07-14 00:48:11,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 00:48:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 861 transitions. [2022-07-14 00:48:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-14 00:48:11,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:48:11,398 INFO L195 NwaCegarLoop]: trace histogram [22, 6, 6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-14 00:48:11,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 00:48:11,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:48:11,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:48:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:48:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -42497240, now seen corresponding path program 3 times [2022-07-14 00:48:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:48:11,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287459010] [2022-07-14 00:48:11,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 00:48:11,610 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:48:11,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:48:11,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:48:11,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 00:48:19,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-14 00:48:19,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:48:19,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:48:19,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:48:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2022-07-14 00:48:19,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:48:19,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:48:19,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287459010] [2022-07-14 00:48:19,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287459010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:48:19,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:48:19,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:48:19,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094583376] [2022-07-14 00:48:19,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:48:19,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:48:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:48:19,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:48:19,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:48:19,738 INFO L87 Difference]: Start difference. First operand 606 states and 861 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:48:20,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:48:20,991 INFO L93 Difference]: Finished difference Result 1201 states and 1718 transitions. [2022-07-14 00:48:20,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:48:20,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 162 [2022-07-14 00:48:20,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:48:20,995 INFO L225 Difference]: With dead ends: 1201 [2022-07-14 00:48:20,995 INFO L226 Difference]: Without dead ends: 661 [2022-07-14 00:48:20,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:48:20,997 INFO L413 NwaCegarLoop]: 831 mSDtfsCounter, 114 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:48:20,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1514 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 00:48:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-14 00:48:21,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2022-07-14 00:48:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 511 states have (on average 1.3737769080234834) internal successors, (702), 513 states have internal predecessors, (702), 115 states have call successors, (115), 34 states have call predecessors, (115), 34 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-07-14 00:48:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 932 transitions. [2022-07-14 00:48:21,010 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 932 transitions. Word has length 162 [2022-07-14 00:48:21,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:48:21,011 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 932 transitions. [2022-07-14 00:48:21,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 00:48:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 932 transitions. [2022-07-14 00:48:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2022-07-14 00:48:21,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:48:21,014 INFO L195 NwaCegarLoop]: trace histogram [22, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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] [2022-07-14 00:48:21,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 00:48:21,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:48:21,228 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:48:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:48:21,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1102966684, now seen corresponding path program 1 times [2022-07-14 00:48:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:48:21,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938556209] [2022-07-14 00:48:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:48:21,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:48:21,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:48:21,231 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:48:21,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 00:48:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:48:22,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 1553 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 00:48:22,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:48:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 330 proven. 21 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2022-07-14 00:48:23,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:48:28,266 INFO L134 CoverageAnalysis]: Checked inductivity of 713 backedges. 152 proven. 21 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2022-07-14 00:48:28,267 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:48:28,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938556209] [2022-07-14 00:48:28,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938556209] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 00:48:28,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 00:48:28,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-14 00:48:28,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448372153] [2022-07-14 00:48:28,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 00:48:28,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 00:48:28,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:48:28,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 00:48:28,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:48:28,268 INFO L87 Difference]: Start difference. First operand 661 states and 932 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-14 00:48:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:48:32,430 INFO L93 Difference]: Finished difference Result 1301 states and 1851 transitions. [2022-07-14 00:48:32,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 00:48:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 230 [2022-07-14 00:48:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:48:32,435 INFO L225 Difference]: With dead ends: 1301 [2022-07-14 00:48:32,435 INFO L226 Difference]: Without dead ends: 671 [2022-07-14 00:48:32,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2022-07-14 00:48:32,437 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 79 mSDsluCounter, 6556 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 7380 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 00:48:32,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 7380 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-14 00:48:32,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-07-14 00:48:32,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 665. [2022-07-14 00:48:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 515 states have (on average 1.3728155339805825) internal successors, (707), 517 states have internal predecessors, (707), 115 states have call successors, (115), 34 states have call predecessors, (115), 34 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-07-14 00:48:32,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 937 transitions. [2022-07-14 00:48:32,472 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 937 transitions. Word has length 230 [2022-07-14 00:48:32,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:48:32,473 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 937 transitions. [2022-07-14 00:48:32,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-14 00:48:32,473 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 937 transitions. [2022-07-14 00:48:32,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-14 00:48:32,499 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:48:32,499 INFO L195 NwaCegarLoop]: trace histogram [24, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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] [2022-07-14 00:48:32,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 00:48:32,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:48:32,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:48:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:48:32,725 INFO L85 PathProgramCache]: Analyzing trace with hash -2074666396, now seen corresponding path program 2 times [2022-07-14 00:48:32,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:48:32,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093163384] [2022-07-14 00:48:32,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 00:48:32,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:48:32,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:48:32,727 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:48:32,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 00:48:33,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 00:48:33,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 00:48:33,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:48:33,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:48:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2022-07-14 00:48:37,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:48:37,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:48:37,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093163384] [2022-07-14 00:48:37,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093163384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:48:37,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:48:37,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 00:48:37,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166047573] [2022-07-14 00:48:37,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:48:37,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:48:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:48:37,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:48:37,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:48:37,343 INFO L87 Difference]: Start difference. First operand 665 states and 937 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:48:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:48:37,667 INFO L93 Difference]: Finished difference Result 1260 states and 1805 transitions. [2022-07-14 00:48:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:48:37,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 232 [2022-07-14 00:48:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:48:37,670 INFO L225 Difference]: With dead ends: 1260 [2022-07-14 00:48:37,670 INFO L226 Difference]: Without dead ends: 665 [2022-07-14 00:48:37,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:48:37,672 INFO L413 NwaCegarLoop]: 770 mSDtfsCounter, 705 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 00:48:37,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 770 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 00:48:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-14 00:48:37,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2022-07-14 00:48:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 515 states have (on average 1.3184466019417476) internal successors, (679), 517 states have internal predecessors, (679), 115 states have call successors, (115), 34 states have call predecessors, (115), 34 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-07-14 00:48:37,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 909 transitions. [2022-07-14 00:48:37,686 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 909 transitions. Word has length 232 [2022-07-14 00:48:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:48:37,688 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 909 transitions. [2022-07-14 00:48:37,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 00:48:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 909 transitions. [2022-07-14 00:48:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-14 00:48:37,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:48:37,691 INFO L195 NwaCegarLoop]: trace histogram [24, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 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] [2022-07-14 00:48:37,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 00:48:37,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:48:37,911 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:48:37,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:48:37,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1199232546, now seen corresponding path program 1 times [2022-07-14 00:48:37,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:48:37,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1318612794] [2022-07-14 00:48:37,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:48:37,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:48:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:48:37,914 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:48:37,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 00:48:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:48:39,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 1575 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 00:48:39,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:48:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2022-07-14 00:48:39,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:48:39,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:48:39,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1318612794] [2022-07-14 00:48:39,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1318612794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:48:39,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:48:39,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 00:48:39,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146043675] [2022-07-14 00:48:39,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:48:39,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 00:48:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:48:39,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 00:48:39,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:48:39,475 INFO L87 Difference]: Start difference. First operand 665 states and 909 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:48:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:48:40,192 INFO L93 Difference]: Finished difference Result 1848 states and 2552 transitions. [2022-07-14 00:48:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 00:48:40,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 232 [2022-07-14 00:48:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:48:40,200 INFO L225 Difference]: With dead ends: 1848 [2022-07-14 00:48:40,200 INFO L226 Difference]: Without dead ends: 1227 [2022-07-14 00:48:40,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:48:40,202 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 742 mSDsluCounter, 3846 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 5381 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 00:48:40,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 5381 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 00:48:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-07-14 00:48:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1171. [2022-07-14 00:48:40,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 910 states have (on average 1.3318681318681318) internal successors, (1212), 911 states have internal predecessors, (1212), 205 states have call successors, (205), 55 states have call predecessors, (205), 55 states have return successors, (205), 204 states have call predecessors, (205), 205 states have call successors, (205) [2022-07-14 00:48:40,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1622 transitions. [2022-07-14 00:48:40,225 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1622 transitions. Word has length 232 [2022-07-14 00:48:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:48:40,227 INFO L495 AbstractCegarLoop]: Abstraction has 1171 states and 1622 transitions. [2022-07-14 00:48:40,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:48:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1622 transitions. [2022-07-14 00:48:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2022-07-14 00:48:40,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:48:40,229 INFO L195 NwaCegarLoop]: trace histogram [24, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 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] [2022-07-14 00:48:40,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 00:48:40,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:48:40,447 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:48:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:48:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 66608125, now seen corresponding path program 1 times [2022-07-14 00:48:40,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:48:40,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558335367] [2022-07-14 00:48:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:48:40,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:48:40,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:48:40,450 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 00:48:40,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 00:48:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:48:41,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 1659 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:48:41,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:48:43,137 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2022-07-14 00:48:43,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:48:43,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:48:43,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558335367] [2022-07-14 00:48:43,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558335367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:48:43,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:48:43,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:48:43,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49912405] [2022-07-14 00:48:43,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:48:43,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:48:43,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:48:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:48:43,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:48:43,140 INFO L87 Difference]: Start difference. First operand 1171 states and 1622 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-14 00:48:44,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:48:44,636 INFO L93 Difference]: Finished difference Result 2762 states and 3865 transitions. [2022-07-14 00:48:44,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:48:44,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 252 [2022-07-14 00:48:44,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:48:44,643 INFO L225 Difference]: With dead ends: 2762 [2022-07-14 00:48:44,643 INFO L226 Difference]: Without dead ends: 1661 [2022-07-14 00:48:44,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:48:44,647 INFO L413 NwaCegarLoop]: 877 mSDtfsCounter, 311 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:48:44,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1540 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 00:48:44,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2022-07-14 00:48:44,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1659. [2022-07-14 00:48:44,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1306 states have (on average 1.3238897396630933) internal successors, (1729), 1308 states have internal predecessors, (1729), 263 states have call successors, (263), 89 states have call predecessors, (263), 89 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-14 00:48:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2255 transitions. [2022-07-14 00:48:44,702 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2255 transitions. Word has length 252 [2022-07-14 00:48:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:48:44,703 INFO L495 AbstractCegarLoop]: Abstraction has 1659 states and 2255 transitions. [2022-07-14 00:48:44,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 3 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-14 00:48:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2255 transitions. [2022-07-14 00:48:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-14 00:48:44,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:48:44,705 INFO L195 NwaCegarLoop]: trace histogram [24, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 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] [2022-07-14 00:48:44,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-14 00:48:44,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:48:44,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:48:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:48:44,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1994663842, now seen corresponding path program 1 times [2022-07-14 00:48:44,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:48:44,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563169737] [2022-07-14 00:48:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:48:44,931 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:48:44,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:48:44,932 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) [2022-07-14 00:48:44,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 00:48:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:48:46,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 1679 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:48:46,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:48:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2022-07-14 00:48:46,380 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:48:46,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:48:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563169737] [2022-07-14 00:48:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563169737] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:48:46,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:48:46,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:48:46,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203495193] [2022-07-14 00:48:46,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:48:46,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:48:46,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:48:46,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:48:46,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:48:46,381 INFO L87 Difference]: Start difference. First operand 1659 states and 2255 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-14 00:48:48,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-14 00:48:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:48:48,620 INFO L93 Difference]: Finished difference Result 3252 states and 4445 transitions. [2022-07-14 00:48:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:48:48,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 262 [2022-07-14 00:48:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:48:48,627 INFO L225 Difference]: With dead ends: 3252 [2022-07-14 00:48:48,627 INFO L226 Difference]: Without dead ends: 1663 [2022-07-14 00:48:48,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:48:48,631 INFO L413 NwaCegarLoop]: 791 mSDtfsCounter, 0 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:48:48,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1578 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 00:48:48,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2022-07-14 00:48:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2022-07-14 00:48:48,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1310 states have (on average 1.3229007633587786) internal successors, (1733), 1312 states have internal predecessors, (1733), 263 states have call successors, (263), 89 states have call predecessors, (263), 89 states have return successors, (263), 261 states have call predecessors, (263), 263 states have call successors, (263) [2022-07-14 00:48:48,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2259 transitions. [2022-07-14 00:48:48,697 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2259 transitions. Word has length 262 [2022-07-14 00:48:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:48:48,698 INFO L495 AbstractCegarLoop]: Abstraction has 1663 states and 2259 transitions. [2022-07-14 00:48:48,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-14 00:48:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2259 transitions. [2022-07-14 00:48:48,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-07-14 00:48:48,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:48:48,700 INFO L195 NwaCegarLoop]: trace histogram [24, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 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] [2022-07-14 00:48:48,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 00:48:48,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:48:48,950 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:48:48,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:48:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2051922144, now seen corresponding path program 1 times [2022-07-14 00:48:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:48:48,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458698824] [2022-07-14 00:48:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:48:48,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:48:48,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:48:48,952 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) [2022-07-14 00:48:48,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 00:48:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:48:50,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 1681 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 00:48:50,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 252 proven. 4 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2022-07-14 00:49:04,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 00:49:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2022-07-14 00:49:06,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:49:06,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458698824] [2022-07-14 00:49:06,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458698824] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 00:49:06,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 00:49:06,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [17] total 18 [2022-07-14 00:49:06,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839424487] [2022-07-14 00:49:06,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:06,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:49:06,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:49:06,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:49:06,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:49:06,729 INFO L87 Difference]: Start difference. First operand 1663 states and 2259 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:49:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:06,941 INFO L93 Difference]: Finished difference Result 3216 states and 4387 transitions. [2022-07-14 00:49:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:49:06,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 262 [2022-07-14 00:49:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:06,954 INFO L225 Difference]: With dead ends: 3216 [2022-07-14 00:49:06,954 INFO L226 Difference]: Without dead ends: 3214 [2022-07-14 00:49:06,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 506 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-14 00:49:06,956 INFO L413 NwaCegarLoop]: 946 mSDtfsCounter, 684 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:06,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 1711 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 00:49:06,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2022-07-14 00:49:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3210. [2022-07-14 00:49:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3210 states, 2533 states have (on average 1.3304382155546783) internal successors, (3370), 2539 states have internal predecessors, (3370), 504 states have call successors, (504), 172 states have call predecessors, (504), 172 states have return successors, (504), 498 states have call predecessors, (504), 504 states have call successors, (504) [2022-07-14 00:49:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3210 states to 3210 states and 4378 transitions. [2022-07-14 00:49:07,036 INFO L78 Accepts]: Start accepts. Automaton has 3210 states and 4378 transitions. Word has length 262 [2022-07-14 00:49:07,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:07,038 INFO L495 AbstractCegarLoop]: Abstraction has 3210 states and 4378 transitions. [2022-07-14 00:49:07,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 00:49:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3210 states and 4378 transitions. [2022-07-14 00:49:07,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-07-14 00:49:07,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:07,040 INFO L195 NwaCegarLoop]: trace histogram [24, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:07,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 00:49:07,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:49:07,255 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:07,256 INFO L85 PathProgramCache]: Analyzing trace with hash -697343136, now seen corresponding path program 1 times [2022-07-14 00:49:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:49:07,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252134798] [2022-07-14 00:49:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:49:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:49:07,258 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) [2022-07-14 00:49:07,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 00:49:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:08,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 1695 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 00:49:08,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2022-07-14 00:49:09,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:09,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:49:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252134798] [2022-07-14 00:49:09,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252134798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:09,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:09,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 00:49:09,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387107422] [2022-07-14 00:49:09,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:09,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 00:49:09,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:49:09,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 00:49:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:49:09,045 INFO L87 Difference]: Start difference. First operand 3210 states and 4378 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:49:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:10,842 INFO L93 Difference]: Finished difference Result 7332 states and 10080 transitions. [2022-07-14 00:49:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 00:49:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 271 [2022-07-14 00:49:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:10,857 INFO L225 Difference]: With dead ends: 7332 [2022-07-14 00:49:10,857 INFO L226 Difference]: Without dead ends: 4192 [2022-07-14 00:49:10,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 00:49:10,865 INFO L413 NwaCegarLoop]: 1056 mSDtfsCounter, 394 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:10,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 1665 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-14 00:49:10,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4192 states. [2022-07-14 00:49:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4192 to 4190. [2022-07-14 00:49:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4190 states, 3329 states have (on average 1.3235205767497746) internal successors, (4406), 3337 states have internal predecessors, (4406), 620 states have call successors, (620), 240 states have call predecessors, (620), 240 states have return successors, (620), 612 states have call predecessors, (620), 620 states have call successors, (620) [2022-07-14 00:49:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 5646 transitions. [2022-07-14 00:49:10,979 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 5646 transitions. Word has length 271 [2022-07-14 00:49:10,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:10,980 INFO L495 AbstractCegarLoop]: Abstraction has 4190 states and 5646 transitions. [2022-07-14 00:49:10,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 00:49:10,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 5646 transitions. [2022-07-14 00:49:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-07-14 00:49:10,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:10,983 INFO L195 NwaCegarLoop]: trace histogram [24, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:11,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 00:49:11,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:49:11,201 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:11,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 772665600, now seen corresponding path program 1 times [2022-07-14 00:49:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:49:11,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238834286] [2022-07-14 00:49:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:49:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:49:11,204 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) [2022-07-14 00:49:11,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 00:49:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:12,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 1752 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 00:49:12,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 871 trivial. 0 not checked. [2022-07-14 00:49:12,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:12,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:49:12,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238834286] [2022-07-14 00:49:12,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238834286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:12,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:12,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 00:49:12,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196076320] [2022-07-14 00:49:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:12,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 00:49:12,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:49:12,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 00:49:12,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 00:49:12,926 INFO L87 Difference]: Start difference. First operand 4190 states and 5646 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 00:49:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:13,680 INFO L93 Difference]: Finished difference Result 10602 states and 14206 transitions. [2022-07-14 00:49:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 00:49:13,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 292 [2022-07-14 00:49:13,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:13,703 INFO L225 Difference]: With dead ends: 10602 [2022-07-14 00:49:13,703 INFO L226 Difference]: Without dead ends: 6482 [2022-07-14 00:49:13,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 00:49:13,711 INFO L413 NwaCegarLoop]: 1185 mSDtfsCounter, 590 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 3001 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:13,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 3001 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 00:49:13,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6482 states. [2022-07-14 00:49:13,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6482 to 4198. [2022-07-14 00:49:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4198 states, 3337 states have (on average 1.3227449805214264) internal successors, (4414), 3345 states have internal predecessors, (4414), 620 states have call successors, (620), 240 states have call predecessors, (620), 240 states have return successors, (620), 612 states have call predecessors, (620), 620 states have call successors, (620) [2022-07-14 00:49:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4198 states to 4198 states and 5654 transitions. [2022-07-14 00:49:13,907 INFO L78 Accepts]: Start accepts. Automaton has 4198 states and 5654 transitions. Word has length 292 [2022-07-14 00:49:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 00:49:13,908 INFO L495 AbstractCegarLoop]: Abstraction has 4198 states and 5654 transitions. [2022-07-14 00:49:13,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 00:49:13,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4198 states and 5654 transitions. [2022-07-14 00:49:13,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2022-07-14 00:49:13,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 00:49:13,929 INFO L195 NwaCegarLoop]: trace histogram [24, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 00:49:13,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-14 00:49:14,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 00:49:14,166 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_check_ttyErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-14 00:49:14,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 00:49:14,166 INFO L85 PathProgramCache]: Analyzing trace with hash -96459902, now seen corresponding path program 1 times [2022-07-14 00:49:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 00:49:14,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115557780] [2022-07-14 00:49:14,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 00:49:14,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 00:49:14,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 00:49:14,169 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) [2022-07-14 00:49:14,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 00:49:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 00:49:15,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 1849 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 00:49:15,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 00:49:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2022-07-14 00:49:17,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 00:49:17,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 00:49:17,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115557780] [2022-07-14 00:49:17,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115557780] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 00:49:17,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 00:49:17,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 00:49:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176068407] [2022-07-14 00:49:17,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 00:49:17,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 00:49:17,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 00:49:17,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 00:49:17,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 00:49:17,125 INFO L87 Difference]: Start difference. First operand 4198 states and 5654 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 6 states have internal predecessors, (113), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 00:49:18,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 00:49:18,640 INFO L93 Difference]: Finished difference Result 9220 states and 12465 transitions. [2022-07-14 00:49:18,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 00:49:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 6 states have internal predecessors, (113), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (22), 4 states have call predecessors, (22), 2 states have call successors, (22) Word has length 298 [2022-07-14 00:49:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 00:49:18,664 INFO L225 Difference]: With dead ends: 9220 [2022-07-14 00:49:18,665 INFO L226 Difference]: Without dead ends: 5092 [2022-07-14 00:49:18,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 00:49:18,675 INFO L413 NwaCegarLoop]: 979 mSDtfsCounter, 158 mSDsluCounter, 5682 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 6661 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 00:49:18,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 6661 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 00:49:18,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states.