./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.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 9f2fac8642c25f1335350a2814ff7cf3c4ea0fb7f4feaed63baec564397e8f24 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:26:56,380 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:26:56,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:26:56,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:26:56,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:26:56,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:26:56,428 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:26:56,430 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:26:56,431 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:26:56,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:26:56,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:26:56,437 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:26:56,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:26:56,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:26:56,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:26:56,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:26:56,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:26:56,448 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:26:56,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:26:56,453 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:26:56,454 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:26:56,454 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:26:56,455 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:26:56,456 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:26:56,457 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:26:56,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:26:56,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:26:56,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:26:56,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:26:56,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:26:56,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:26:56,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:26:56,465 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:26:56,466 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:26:56,466 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:26:56,467 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:26:56,467 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:26:56,467 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:26:56,468 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:26:56,468 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:26:56,469 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:26:56,470 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:26:56,471 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 12:26:56,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:26:56,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:26:56,486 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:26:56,486 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:26:56,487 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:26:56,487 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:26:56,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:26:56,488 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:26:56,488 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:26:56,489 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:26:56,489 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 12:26:56,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:26:56,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:26:56,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:26:56,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:26:56,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:26:56,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:26:56,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:26:56,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:26:56,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:26:56,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:26:56,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:26:56,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:26:56,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:26:56,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:26:56,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 12:26:56,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 12:26:56,492 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:26:56,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:26:56,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:26:56,493 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 -> 9f2fac8642c25f1335350a2814ff7cf3c4ea0fb7f4feaed63baec564397e8f24 [2022-07-12 12:26:56,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:26:56,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:26:56,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:26:56,721 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:26:56,721 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:26:56,722 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-12 12:26:56,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7ffdcd4/d9257d19af6542128d664241fedc7a87/FLAG31464af4a [2022-07-12 12:26:57,406 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:26:57,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-12 12:26:57,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7ffdcd4/d9257d19af6542128d664241fedc7a87/FLAG31464af4a [2022-07-12 12:26:57,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7ffdcd4/d9257d19af6542128d664241fedc7a87 [2022-07-12 12:26:57,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:26:57,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:26:57,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:26:57,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:26:57,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:26:57,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:26:57" (1/1) ... [2022-07-12 12:26:57,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4008f34a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:57, skipping insertion in model container [2022-07-12 12:26:57,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:26:57" (1/1) ... [2022-07-12 12:26:57,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:26:57,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:26:58,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-12 12:26:58,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:26:58,761 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:26:58,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-12 12:26:58,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:26:59,012 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:26:59,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59 WrapperNode [2022-07-12 12:26:59,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:26:59,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:26:59,015 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:26:59,015 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:26:59,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,162 INFO L137 Inliner]: procedures = 163, calls = 1186, calls flagged for inlining = 76, calls inlined = 76, statements flattened = 3081 [2022-07-12 12:26:59,162 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:26:59,163 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:26:59,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:26:59,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:26:59,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,297 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,321 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:26:59,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:26:59,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:26:59,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:26:59,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (1/1) ... [2022-07-12 12:26:59,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:26:59,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:26:59,376 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-12 12:26:59,394 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-12 12:26:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-12 12:26:59,410 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-12 12:26:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_unregister_dev [2022-07-12 12:26:59,410 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_unregister_dev [2022-07-12 12:26:59,410 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2022-07-12 12:26:59,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2022-07-12 12:26:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_from_linear_data [2022-07-12 12:26:59,411 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_from_linear_data [2022-07-12 12:26:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 12:26:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2022-07-12 12:26:59,411 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2022-07-12 12:26:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:26:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:26:59,411 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-12 12:26:59,412 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-12 12:26:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:26:59,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:26:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 12:26:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-12 12:26:59,412 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-12 12:26:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-12 12:26:59,412 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-12 12:26:59,412 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-12 12:26:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-12 12:26:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:26:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:26:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_disconnect [2022-07-12 12:26:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_disconnect [2022-07-12 12:26:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:26:59,413 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:26:59,413 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:26:59,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:26:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-12 12:26:59,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-12 12:26:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:26:59,414 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:26:59,414 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_get_priv [2022-07-12 12:26:59,414 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_get_priv [2022-07-12 12:26:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_submit_rx_urb [2022-07-12 12:26:59,415 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_submit_rx_urb [2022-07-12 12:26:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:26:59,415 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:26:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 12:26:59,415 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:26:59,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:26:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_rx_complete [2022-07-12 12:26:59,416 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_rx_complete [2022-07-12 12:26:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-12 12:26:59,416 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-12 12:26:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-12 12:26:59,416 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-12 12:26:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:26:59,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:26:59,416 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-12 12:26:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-12 12:26:59,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:26:59,417 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:26:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:26:59,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:26:59,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:26:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-12 12:26:59,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-12 12:26:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-12 12:26:59,419 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-12 12:26:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:26:59,419 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-12 12:26:59,420 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-12 12:26:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 12:26:59,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 12:26:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:26:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:26:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:26:59,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:26:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_cmd_event_complete [2022-07-12 12:26:59,421 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_cmd_event_complete [2022-07-12 12:26:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_8 [2022-07-12 12:26:59,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_8 [2022-07-12 12:26:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:26:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-12 12:26:59,421 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-12 12:26:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-12 12:26:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-12 12:26:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:26:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:26:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_10 [2022-07-12 12:26:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_10 [2022-07-12 12:26:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 12:26:59,422 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 12:26:59,422 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-12 12:26:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-12 12:26:59,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 12:26:59,423 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_resume [2022-07-12 12:26:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_resume [2022-07-12 12:26:59,423 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-12 12:26:59,423 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-12 12:26:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 12:26:59,424 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 12:26:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 12:26:59,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u8 [2022-07-12 12:26:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:26:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:26:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:26:59,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:26:59,425 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_out [2022-07-12 12:26:59,426 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_out [2022-07-12 12:26:59,868 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:26:59,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:27:00,077 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:27:00,605 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-12 12:27:03,825 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:27:03,839 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:27:03,840 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 12:27:03,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:27:03 BoogieIcfgContainer [2022-07-12 12:27:03,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:27:03,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:27:03,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:27:03,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:27:03,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:26:57" (1/3) ... [2022-07-12 12:27:03,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186533cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:27:03, skipping insertion in model container [2022-07-12 12:27:03,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:26:59" (2/3) ... [2022-07-12 12:27:03,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186533cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:27:03, skipping insertion in model container [2022-07-12 12:27:03,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:27:03" (3/3) ... [2022-07-12 12:27:03,857 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-12 12:27:03,869 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:27:03,870 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:27:03,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:27:03,937 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@3a849fde, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ae8b184 [2022-07-12 12:27:03,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:27:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 855 states, 631 states have (on average 1.3851030110935023) internal successors, (874), 657 states have internal predecessors, (874), 180 states have call successors, (180), 44 states have call predecessors, (180), 42 states have return successors, (174), 166 states have call predecessors, (174), 174 states have call successors, (174) [2022-07-12 12:27:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 12:27:03,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:03,967 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:27:03,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:03,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:03,972 INFO L85 PathProgramCache]: Analyzing trace with hash -967497407, now seen corresponding path program 1 times [2022-07-12 12:27:03,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:03,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402156742] [2022-07-12 12:27:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:03,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:04,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:04,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:27:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:27:04,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:04,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402156742] [2022-07-12 12:27:04,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402156742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:04,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:04,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:04,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523588042] [2022-07-12 12:27:04,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:04,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:04,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:04,435 INFO L87 Difference]: Start difference. First operand has 855 states, 631 states have (on average 1.3851030110935023) internal successors, (874), 657 states have internal predecessors, (874), 180 states have call successors, (180), 44 states have call predecessors, (180), 42 states have return successors, (174), 166 states have call predecessors, (174), 174 states have call successors, (174) Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:27:06,716 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-12 12:27:08,746 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-12 12:27:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:12,106 INFO L93 Difference]: Finished difference Result 2754 states and 4123 transitions. [2022-07-12 12:27:12,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:12,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-12 12:27:12,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:12,135 INFO L225 Difference]: With dead ends: 2754 [2022-07-12 12:27:12,135 INFO L226 Difference]: Without dead ends: 1880 [2022-07-12 12:27:12,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:27:12,150 INFO L413 NwaCegarLoop]: 1333 mSDtfsCounter, 1894 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 1012 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1012 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:12,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2045 Valid, 3386 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1012 Valid, 1557 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-07-12 12:27:12,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2022-07-12 12:27:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1612. [2022-07-12 12:27:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1197 states have (on average 1.3751044277360067) internal successors, (1646), 1229 states have internal predecessors, (1646), 332 states have call successors, (332), 83 states have call predecessors, (332), 82 states have return successors, (327), 311 states have call predecessors, (327), 327 states have call successors, (327) [2022-07-12 12:27:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2305 transitions. [2022-07-12 12:27:12,302 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2305 transitions. Word has length 44 [2022-07-12 12:27:12,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:12,303 INFO L495 AbstractCegarLoop]: Abstraction has 1612 states and 2305 transitions. [2022-07-12 12:27:12,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:27:12,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2305 transitions. [2022-07-12 12:27:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 12:27:12,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:12,308 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:27:12,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 12:27:12,309 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:12,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1415687837, now seen corresponding path program 1 times [2022-07-12 12:27:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:12,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615181304] [2022-07-12 12:27:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:27:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:27:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:27:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:27:12,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:12,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615181304] [2022-07-12 12:27:12,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615181304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:12,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:12,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:12,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705766729] [2022-07-12 12:27:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:12,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:12,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:12,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:12,640 INFO L87 Difference]: Start difference. First operand 1612 states and 2305 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:14,813 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-12 12:27:16,845 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-12 12:27:19,789 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-12 12:27:21,812 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-12 12:27:24,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:24,343 INFO L93 Difference]: Finished difference Result 5349 states and 7945 transitions. [2022-07-12 12:27:24,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:24,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-07-12 12:27:24,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:24,361 INFO L225 Difference]: With dead ends: 5349 [2022-07-12 12:27:24,361 INFO L226 Difference]: Without dead ends: 3748 [2022-07-12 12:27:24,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:27:24,367 INFO L413 NwaCegarLoop]: 1358 mSDtfsCounter, 1949 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 1010 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1010 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:24,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 3463 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1010 Valid, 1566 Invalid, 4 Unknown, 0 Unchecked, 11.4s Time] [2022-07-12 12:27:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2022-07-12 12:27:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3286. [2022-07-12 12:27:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3286 states, 2434 states have (on average 1.3697617091207888) internal successors, (3334), 2504 states have internal predecessors, (3334), 671 states have call successors, (671), 165 states have call predecessors, (671), 180 states have return successors, (762), 642 states have call predecessors, (762), 666 states have call successors, (762) [2022-07-12 12:27:24,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3286 states to 3286 states and 4767 transitions. [2022-07-12 12:27:24,484 INFO L78 Accepts]: Start accepts. Automaton has 3286 states and 4767 transitions. Word has length 61 [2022-07-12 12:27:24,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:24,485 INFO L495 AbstractCegarLoop]: Abstraction has 3286 states and 4767 transitions. [2022-07-12 12:27:24,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:24,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3286 states and 4767 transitions. [2022-07-12 12:27:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 12:27:24,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:24,489 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:27:24,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 12:27:24,492 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:24,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:24,492 INFO L85 PathProgramCache]: Analyzing trace with hash -937016713, now seen corresponding path program 1 times [2022-07-12 12:27:24,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:24,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83827359] [2022-07-12 12:27:24,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:24,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:24,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:24,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:24,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:27:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:24,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:27:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:24,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:27:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:27:24,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:24,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83827359] [2022-07-12 12:27:24,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83827359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:24,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:24,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:24,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466844183] [2022-07-12 12:27:24,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:24,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:24,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:24,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:24,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:24,810 INFO L87 Difference]: Start difference. First operand 3286 states and 4767 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:27,004 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-12 12:27:29,035 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-12 12:27:32,671 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-12 12:27:34,703 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-12 12:27:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:36,856 INFO L93 Difference]: Finished difference Result 10731 states and 16197 transitions. [2022-07-12 12:27:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:36,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-07-12 12:27:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:36,907 INFO L225 Difference]: With dead ends: 10731 [2022-07-12 12:27:36,907 INFO L226 Difference]: Without dead ends: 7456 [2022-07-12 12:27:36,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:27:36,927 INFO L413 NwaCegarLoop]: 1299 mSDtfsCounter, 2006 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 1034 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2143 SdHoareTripleChecker+Valid, 3317 SdHoareTripleChecker+Invalid, 2564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:36,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2143 Valid, 3317 Invalid, 2564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1526 Invalid, 4 Unknown, 0 Unchecked, 11.7s Time] [2022-07-12 12:27:36,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7456 states. [2022-07-12 12:27:37,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7456 to 6627. [2022-07-12 12:27:37,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6627 states, 4901 states have (on average 1.3650275453988983) internal successors, (6690), 5047 states have internal predecessors, (6690), 1349 states have call successors, (1349), 329 states have call predecessors, (1349), 376 states have return successors, (1702), 1304 states have call predecessors, (1702), 1344 states have call successors, (1702) [2022-07-12 12:27:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 9741 transitions. [2022-07-12 12:27:37,284 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 9741 transitions. Word has length 62 [2022-07-12 12:27:37,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:37,285 INFO L495 AbstractCegarLoop]: Abstraction has 6627 states and 9741 transitions. [2022-07-12 12:27:37,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 9741 transitions. [2022-07-12 12:27:37,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-12 12:27:37,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:37,288 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:27:37,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 12:27:37,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1016891110, now seen corresponding path program 1 times [2022-07-12 12:27:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:37,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153522119] [2022-07-12 12:27:37,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:37,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:37,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:37,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:27:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:27:37,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:27:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:27:37,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:37,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153522119] [2022-07-12 12:27:37,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153522119] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:37,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:37,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644746269] [2022-07-12 12:27:37,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:37,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:37,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:37,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:37,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:37,559 INFO L87 Difference]: Start difference. First operand 6627 states and 9741 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:39,710 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-12 12:27:41,740 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-12 12:27:45,334 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-12 12:27:47,367 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-12 12:27:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:48,926 INFO L93 Difference]: Finished difference Result 7454 states and 11168 transitions. [2022-07-12 12:27:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 12:27:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-07-12 12:27:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:48,962 INFO L225 Difference]: With dead ends: 7454 [2022-07-12 12:27:48,963 INFO L226 Difference]: Without dead ends: 7451 [2022-07-12 12:27:48,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:27:48,968 INFO L413 NwaCegarLoop]: 1303 mSDtfsCounter, 2003 mSDsluCounter, 2018 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 1026 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2142 SdHoareTripleChecker+Valid, 3321 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1026 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:48,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2142 Valid, 3321 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1026 Valid, 1525 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2022-07-12 12:27:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7451 states. [2022-07-12 12:27:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7451 to 6628. [2022-07-12 12:27:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6628 states, 4902 states have (on average 1.364953080375357) internal successors, (6691), 5048 states have internal predecessors, (6691), 1349 states have call successors, (1349), 329 states have call predecessors, (1349), 376 states have return successors, (1702), 1304 states have call predecessors, (1702), 1344 states have call successors, (1702) [2022-07-12 12:27:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6628 states to 6628 states and 9742 transitions. [2022-07-12 12:27:49,220 INFO L78 Accepts]: Start accepts. Automaton has 6628 states and 9742 transitions. Word has length 63 [2022-07-12 12:27:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:49,222 INFO L495 AbstractCegarLoop]: Abstraction has 6628 states and 9742 transitions. [2022-07-12 12:27:49,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6628 states and 9742 transitions. [2022-07-12 12:27:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-12 12:27:49,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:49,225 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:27:49,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 12:27:49,226 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:49,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:49,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1458496346, now seen corresponding path program 1 times [2022-07-12 12:27:49,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:49,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933511543] [2022-07-12 12:27:49,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:49,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:49,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:49,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:49,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:49,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:49,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:49,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:27:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:49,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:27:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:49,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:27:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:49,459 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:27:49,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:49,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933511543] [2022-07-12 12:27:49,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933511543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:49,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:49,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:49,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149547323] [2022-07-12 12:27:49,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:49,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:49,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:49,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:49,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:49,463 INFO L87 Difference]: Start difference. First operand 6628 states and 9742 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:51,602 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-12 12:27:53,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 12:27:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:27:55,812 INFO L93 Difference]: Finished difference Result 7450 states and 11164 transitions. [2022-07-12 12:27:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:27:55,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2022-07-12 12:27:55,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:27:55,845 INFO L225 Difference]: With dead ends: 7450 [2022-07-12 12:27:55,845 INFO L226 Difference]: Without dead ends: 7447 [2022-07-12 12:27:55,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:27:55,850 INFO L413 NwaCegarLoop]: 1124 mSDtfsCounter, 1541 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 574 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 574 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:27:55,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 2212 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [574 Valid, 796 Invalid, 2 Unknown, 0 Unchecked, 6.2s Time] [2022-07-12 12:27:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7447 states. [2022-07-12 12:27:56,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7447 to 6627. [2022-07-12 12:27:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6627 states, 4902 states have (on average 1.364749082007344) internal successors, (6690), 5047 states have internal predecessors, (6690), 1348 states have call successors, (1348), 329 states have call predecessors, (1348), 376 states have return successors, (1702), 1304 states have call predecessors, (1702), 1344 states have call successors, (1702) [2022-07-12 12:27:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6627 states to 6627 states and 9740 transitions. [2022-07-12 12:27:56,064 INFO L78 Accepts]: Start accepts. Automaton has 6627 states and 9740 transitions. Word has length 64 [2022-07-12 12:27:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:27:56,064 INFO L495 AbstractCegarLoop]: Abstraction has 6627 states and 9740 transitions. [2022-07-12 12:27:56,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 6627 states and 9740 transitions. [2022-07-12 12:27:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 12:27:56,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:27:56,067 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:27:56,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 12:27:56,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:27:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:27:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash -2031605655, now seen corresponding path program 1 times [2022-07-12 12:27:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:27:56,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151648492] [2022-07-12 12:27:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:27:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:27:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:27:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:27:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:27:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:27:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:27:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:27:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:27:56,237 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:27:56,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:27:56,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151648492] [2022-07-12 12:27:56,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151648492] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:27:56,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:27:56,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:27:56,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359377469] [2022-07-12 12:27:56,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:27:56,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:27:56,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:27:56,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:27:56,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:27:56,239 INFO L87 Difference]: Start difference. First operand 6627 states and 9740 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:27:58,383 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-12 12:28:00,419 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-12 12:28:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:02,363 INFO L93 Difference]: Finished difference Result 7449 states and 11162 transitions. [2022-07-12 12:28:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:28:02,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 65 [2022-07-12 12:28:02,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:02,417 INFO L225 Difference]: With dead ends: 7449 [2022-07-12 12:28:02,417 INFO L226 Difference]: Without dead ends: 7417 [2022-07-12 12:28:02,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:28:02,422 INFO L413 NwaCegarLoop]: 1123 mSDtfsCounter, 1537 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 571 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1678 SdHoareTripleChecker+Valid, 2213 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:02,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1678 Valid, 2213 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 792 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2022-07-12 12:28:02,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7417 states. [2022-07-12 12:28:02,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7417 to 6597. [2022-07-12 12:28:02,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6597 states, 4875 states have (on average 1.3645128205128205) internal successors, (6652), 5019 states have internal predecessors, (6652), 1345 states have call successors, (1345), 329 states have call predecessors, (1345), 376 states have return successors, (1696), 1302 states have call predecessors, (1696), 1342 states have call successors, (1696) [2022-07-12 12:28:02,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 9693 transitions. [2022-07-12 12:28:02,611 INFO L78 Accepts]: Start accepts. Automaton has 6597 states and 9693 transitions. Word has length 65 [2022-07-12 12:28:02,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:02,612 INFO L495 AbstractCegarLoop]: Abstraction has 6597 states and 9693 transitions. [2022-07-12 12:28:02,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:28:02,613 INFO L276 IsEmpty]: Start isEmpty. Operand 6597 states and 9693 transitions. [2022-07-12 12:28:02,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 12:28:02,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:02,618 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:28:02,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 12:28:02,618 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:02,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:02,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1428627121, now seen corresponding path program 1 times [2022-07-12 12:28:02,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:02,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851209848] [2022-07-12 12:28:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:02,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 12:28:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:02,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:28:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 12:28:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-12 12:28:02,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:02,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851209848] [2022-07-12 12:28:02,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851209848] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:02,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:02,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:28:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60766173] [2022-07-12 12:28:02,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:02,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:28:02,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:02,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:28:02,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:28:02,809 INFO L87 Difference]: Start difference. First operand 6597 states and 9693 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 12:28:04,945 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-12 12:28:06,983 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-12 12:28:10,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:10,704 INFO L93 Difference]: Finished difference Result 20473 states and 30444 transitions. [2022-07-12 12:28:10,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 12:28:10,705 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2022-07-12 12:28:10,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:10,753 INFO L225 Difference]: With dead ends: 20473 [2022-07-12 12:28:10,753 INFO L226 Difference]: Without dead ends: 13887 [2022-07-12 12:28:10,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:28:10,776 INFO L413 NwaCegarLoop]: 1515 mSDtfsCounter, 2133 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 1597 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 3898 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1597 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:10,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2272 Valid, 3898 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1597 Valid, 1696 Invalid, 2 Unknown, 0 Unchecked, 7.4s Time] [2022-07-12 12:28:10,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13887 states. [2022-07-12 12:28:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13887 to 12437. [2022-07-12 12:28:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12437 states, 9104 states have (on average 1.3474297012302285) internal successors, (12267), 9423 states have internal predecessors, (12267), 2516 states have call successors, (2516), 623 states have call predecessors, (2516), 816 states have return successors, (3667), 2490 states have call predecessors, (3667), 2513 states have call successors, (3667) [2022-07-12 12:28:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12437 states to 12437 states and 18450 transitions. [2022-07-12 12:28:11,230 INFO L78 Accepts]: Start accepts. Automaton has 12437 states and 18450 transitions. Word has length 98 [2022-07-12 12:28:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:11,230 INFO L495 AbstractCegarLoop]: Abstraction has 12437 states and 18450 transitions. [2022-07-12 12:28:11,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 12:28:11,233 INFO L276 IsEmpty]: Start isEmpty. Operand 12437 states and 18450 transitions. [2022-07-12 12:28:11,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-12 12:28:11,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:11,241 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 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] [2022-07-12 12:28:11,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 12:28:11,242 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:11,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:11,242 INFO L85 PathProgramCache]: Analyzing trace with hash -173781947, now seen corresponding path program 1 times [2022-07-12 12:28:11,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:11,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830566587] [2022-07-12 12:28:11,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:11,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:28:11,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:28:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:28:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:28:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 12:28:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-07-12 12:28:11,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:11,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830566587] [2022-07-12 12:28:11,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830566587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:11,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:11,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 12:28:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561929347] [2022-07-12 12:28:11,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:11,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 12:28:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:11,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 12:28:11,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 12:28:11,638 INFO L87 Difference]: Start difference. First operand 12437 states and 18450 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 12:28:13,863 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-12 12:28:15,906 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-12 12:28:17,935 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-12 12:28:21,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:21,983 INFO L93 Difference]: Finished difference Result 26259 states and 39141 transitions. [2022-07-12 12:28:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 12:28:21,983 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 124 [2022-07-12 12:28:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:22,041 INFO L225 Difference]: With dead ends: 26259 [2022-07-12 12:28:22,041 INFO L226 Difference]: Without dead ends: 13844 [2022-07-12 12:28:22,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:28:22,082 INFO L413 NwaCegarLoop]: 1148 mSDtfsCounter, 679 mSDsluCounter, 5112 mSDsCounter, 0 mSdLazyCounter, 2593 mSolverCounterSat, 696 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 6260 SdHoareTripleChecker+Invalid, 3292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 2593 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:22,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 6260 Invalid, 3292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 2593 Invalid, 3 Unknown, 0 Unchecked, 9.8s Time] [2022-07-12 12:28:22,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13844 states. [2022-07-12 12:28:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13844 to 12457. [2022-07-12 12:28:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12457 states, 9120 states have (on average 1.3468201754385964) internal successors, (12283), 9435 states have internal predecessors, (12283), 2520 states have call successors, (2520), 623 states have call predecessors, (2520), 816 states have return successors, (3671), 2498 states have call predecessors, (3671), 2517 states have call successors, (3671) [2022-07-12 12:28:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12457 states to 12457 states and 18474 transitions. [2022-07-12 12:28:22,583 INFO L78 Accepts]: Start accepts. Automaton has 12457 states and 18474 transitions. Word has length 124 [2022-07-12 12:28:22,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:22,584 INFO L495 AbstractCegarLoop]: Abstraction has 12457 states and 18474 transitions. [2022-07-12 12:28:22,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (12), 6 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 12:28:22,584 INFO L276 IsEmpty]: Start isEmpty. Operand 12457 states and 18474 transitions. [2022-07-12 12:28:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 12:28:22,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:22,592 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 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] [2022-07-12 12:28:22,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 12:28:22,593 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash 582365067, now seen corresponding path program 1 times [2022-07-12 12:28:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:22,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172912644] [2022-07-12 12:28:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:22,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-12 12:28:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 12:28:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-12 12:28:22,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 12:28:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 12:28:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 12:28:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:22,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172912644] [2022-07-12 12:28:22,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172912644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:22,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:22,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:28:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215190745] [2022-07-12 12:28:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:22,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:28:22,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:28:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:28:22,933 INFO L87 Difference]: Start difference. First operand 12457 states and 18474 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:28:25,120 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-12 12:28:27,164 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-12 12:28:30,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:30,009 INFO L93 Difference]: Finished difference Result 26280 states and 39126 transitions. [2022-07-12 12:28:30,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:28:30,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2022-07-12 12:28:30,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:30,068 INFO L225 Difference]: With dead ends: 26280 [2022-07-12 12:28:30,069 INFO L226 Difference]: Without dead ends: 13826 [2022-07-12 12:28:30,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:28:30,100 INFO L413 NwaCegarLoop]: 1128 mSDtfsCounter, 914 mSDsluCounter, 2987 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 955 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 4115 SdHoareTripleChecker+Invalid, 2504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:30,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 4115 Invalid, 2504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 1547 Invalid, 2 Unknown, 0 Unchecked, 6.6s Time] [2022-07-12 12:28:30,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13826 states. [2022-07-12 12:28:30,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13826 to 12466. [2022-07-12 12:28:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12466 states, 9129 states have (on average 1.346478256106912) internal successors, (12292), 9444 states have internal predecessors, (12292), 2520 states have call successors, (2520), 623 states have call predecessors, (2520), 816 states have return successors, (3671), 2498 states have call predecessors, (3671), 2517 states have call successors, (3671) [2022-07-12 12:28:30,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 18483 transitions. [2022-07-12 12:28:30,565 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 18483 transitions. Word has length 130 [2022-07-12 12:28:30,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:30,566 INFO L495 AbstractCegarLoop]: Abstraction has 12466 states and 18483 transitions. [2022-07-12 12:28:30,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:28:30,566 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 18483 transitions. [2022-07-12 12:28:30,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 12:28:30,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:30,574 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:30,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 12:28:30,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:30,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:30,575 INFO L85 PathProgramCache]: Analyzing trace with hash -413463987, now seen corresponding path program 1 times [2022-07-12 12:28:30,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:30,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158226974] [2022-07-12 12:28:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:30,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:28:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:28:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 12:28:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:28:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 12:28:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-12 12:28:30,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:30,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158226974] [2022-07-12 12:28:30,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158226974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:30,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118778421] [2022-07-12 12:28:30,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:30,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:30,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:30,980 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-12 12:28:30,983 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-12 12:28:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:31,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 2200 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 12:28:31,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:31,657 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 12:28:31,658 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:28:31,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118778421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:31,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:28:31,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2022-07-12 12:28:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156462915] [2022-07-12 12:28:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:31,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:28:31,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:31,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:28:31,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:28:31,659 INFO L87 Difference]: Start difference. First operand 12466 states and 18483 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:28:31,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:31,996 INFO L93 Difference]: Finished difference Result 20320 states and 30035 transitions. [2022-07-12 12:28:31,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:28:31,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2022-07-12 12:28:31,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:32,029 INFO L225 Difference]: With dead ends: 20320 [2022-07-12 12:28:32,030 INFO L226 Difference]: Without dead ends: 7867 [2022-07-12 12:28:32,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:28:32,089 INFO L413 NwaCegarLoop]: 1195 mSDtfsCounter, 38 mSDsluCounter, 3576 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4771 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:32,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4771 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:28:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7867 states. [2022-07-12 12:28:32,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7867 to 7640. [2022-07-12 12:28:32,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7640 states, 5599 states have (on average 1.342025361671727) internal successors, (7514), 5793 states have internal predecessors, (7514), 1533 states have call successors, (1533), 397 states have call predecessors, (1533), 507 states have return successors, (2172), 1510 states have call predecessors, (2172), 1530 states have call successors, (2172) [2022-07-12 12:28:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7640 states to 7640 states and 11219 transitions. [2022-07-12 12:28:32,362 INFO L78 Accepts]: Start accepts. Automaton has 7640 states and 11219 transitions. Word has length 131 [2022-07-12 12:28:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:32,363 INFO L495 AbstractCegarLoop]: Abstraction has 7640 states and 11219 transitions. [2022-07-12 12:28:32,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:28:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 7640 states and 11219 transitions. [2022-07-12 12:28:32,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 12:28:32,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:32,370 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:28:32,394 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-12 12:28:32,575 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,SelfDestructingSolverStorable9 [2022-07-12 12:28:32,575 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:32,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1984420258, now seen corresponding path program 1 times [2022-07-12 12:28:32,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:32,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933791461] [2022-07-12 12:28:32,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:32,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:32,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:28:32,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-12 12:28:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:32,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:28:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 12:28:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-12 12:28:32,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:28:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 12:28:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-12 12:28:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:32,733 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-07-12 12:28:32,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:32,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933791461] [2022-07-12 12:28:32,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933791461] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:32,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:32,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 12:28:32,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569681916] [2022-07-12 12:28:32,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:32,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 12:28:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:32,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 12:28:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:28:32,735 INFO L87 Difference]: Start difference. First operand 7640 states and 11219 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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-12 12:28:34,849 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-12 12:28:36,872 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-12 12:28:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:43,206 INFO L93 Difference]: Finished difference Result 22089 states and 33842 transitions. [2022-07-12 12:28:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:28:43,207 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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 135 [2022-07-12 12:28:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:43,280 INFO L225 Difference]: With dead ends: 22089 [2022-07-12 12:28:43,280 INFO L226 Difference]: Without dead ends: 13885 [2022-07-12 12:28:43,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:28:43,309 INFO L413 NwaCegarLoop]: 1614 mSDtfsCounter, 2466 mSDsluCounter, 3929 mSDsCounter, 0 mSdLazyCounter, 3105 mSolverCounterSat, 1768 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2619 SdHoareTripleChecker+Valid, 5543 SdHoareTripleChecker+Invalid, 4875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1768 IncrementalHoareTripleChecker+Valid, 3105 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.8s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:43,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2619 Valid, 5543 Invalid, 4875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1768 Valid, 3105 Invalid, 2 Unknown, 0 Unchecked, 9.8s Time] [2022-07-12 12:28:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13885 states. [2022-07-12 12:28:43,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13885 to 11472. [2022-07-12 12:28:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 8339 states have (on average 1.337570452092577) internal successors, (11154), 8682 states have internal predecessors, (11154), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2306 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-12 12:28:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17695 transitions. [2022-07-12 12:28:43,812 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17695 transitions. Word has length 135 [2022-07-12 12:28:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:43,813 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 17695 transitions. [2022-07-12 12:28:43,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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-12 12:28:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17695 transitions. [2022-07-12 12:28:43,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 12:28:43,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:43,819 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 12:28:43,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 12:28:43,819 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:43,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2017702408, now seen corresponding path program 1 times [2022-07-12 12:28:43,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:43,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352813803] [2022-07-12 12:28:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:43,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:44,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:28:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:28:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:28:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:28:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:28:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:28:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 12:28:44,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352813803] [2022-07-12 12:28:44,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352813803] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:44,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295241956] [2022-07-12 12:28:44,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:44,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:44,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:44,177 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-12 12:28:44,195 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-12 12:28:45,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:45,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 2277 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 12:28:45,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:45,165 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 12:28:45,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:28:45,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295241956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:45,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:28:45,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-12 12:28:45,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965652977] [2022-07-12 12:28:45,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:45,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:28:45,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:45,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:28:45,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:28:45,167 INFO L87 Difference]: Start difference. First operand 11472 states and 17695 transitions. Second operand has 8 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 12:28:45,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:45,779 INFO L93 Difference]: Finished difference Result 22916 states and 35355 transitions. [2022-07-12 12:28:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:28:45,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 137 [2022-07-12 12:28:45,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:45,825 INFO L225 Difference]: With dead ends: 22916 [2022-07-12 12:28:45,825 INFO L226 Difference]: Without dead ends: 11486 [2022-07-12 12:28:45,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-07-12 12:28:45,859 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 435 mSDsluCounter, 6601 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 7792 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:45,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 7792 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:28:45,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11486 states. [2022-07-12 12:28:46,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11486 to 11472. [2022-07-12 12:28:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 8339 states have (on average 1.337090778270776) internal successors, (11150), 8682 states have internal predecessors, (11150), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2306 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-12 12:28:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17691 transitions. [2022-07-12 12:28:46,312 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17691 transitions. Word has length 137 [2022-07-12 12:28:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:46,313 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 17691 transitions. [2022-07-12 12:28:46,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-12 12:28:46,313 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17691 transitions. [2022-07-12 12:28:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 12:28:46,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:46,318 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 12:28:46,347 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-12 12:28:46,535 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,SelfDestructingSolverStorable11 [2022-07-12 12:28:46,536 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:46,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:46,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1438231226, now seen corresponding path program 1 times [2022-07-12 12:28:46,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:46,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73291304] [2022-07-12 12:28:46,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:46,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:28:46,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:28:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:28:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:28:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:28:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:28:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:46,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 12:28:46,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:46,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73291304] [2022-07-12 12:28:46,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73291304] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:46,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675590415] [2022-07-12 12:28:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:46,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:46,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:46,883 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-12 12:28:46,908 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-12 12:28:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:47,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 2278 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 12:28:47,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:47,602 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-12 12:28:47,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:28:47,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675590415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:47,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:28:47,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2022-07-12 12:28:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589594119] [2022-07-12 12:28:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:47,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:28:47,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:28:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-12 12:28:47,605 INFO L87 Difference]: Start difference. First operand 11472 states and 17691 transitions. Second operand has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 12:28:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:48,068 INFO L93 Difference]: Finished difference Result 22902 states and 35331 transitions. [2022-07-12 12:28:48,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:28:48,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 137 [2022-07-12 12:28:48,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:48,119 INFO L225 Difference]: With dead ends: 22902 [2022-07-12 12:28:48,119 INFO L226 Difference]: Without dead ends: 11472 [2022-07-12 12:28:48,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-12 12:28:48,156 INFO L413 NwaCegarLoop]: 1189 mSDtfsCounter, 446 mSDsluCounter, 4203 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 5392 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:48,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 5392 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:28:48,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2022-07-12 12:28:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11472. [2022-07-12 12:28:48,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11472 states, 8339 states have (on average 1.3366111044489748) internal successors, (11146), 8682 states have internal predecessors, (11146), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2306 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-12 12:28:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11472 states to 11472 states and 17687 transitions. [2022-07-12 12:28:48,624 INFO L78 Accepts]: Start accepts. Automaton has 11472 states and 17687 transitions. Word has length 137 [2022-07-12 12:28:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:48,624 INFO L495 AbstractCegarLoop]: Abstraction has 11472 states and 17687 transitions. [2022-07-12 12:28:48,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 12:28:48,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11472 states and 17687 transitions. [2022-07-12 12:28:48,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 12:28:48,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:48,630 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 12:28:48,651 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-12 12:28:48,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:48,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:48,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:48,852 INFO L85 PathProgramCache]: Analyzing trace with hash 162839880, now seen corresponding path program 1 times [2022-07-12 12:28:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:48,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170659956] [2022-07-12 12:28:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:48,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:28:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:28:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:28:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:28:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:28:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:28:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-12 12:28:49,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:49,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170659956] [2022-07-12 12:28:49,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170659956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:28:49,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283288109] [2022-07-12 12:28:49,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:49,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:49,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:28:49,163 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-12 12:28:49,164 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-12 12:28:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:50,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 2279 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 12:28:50,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:28:51,173 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 12:28:51,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:28:51,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283288109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:51,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 12:28:51,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-07-12 12:28:51,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980103024] [2022-07-12 12:28:51,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:51,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:28:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:51,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:28:51,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2022-07-12 12:28:51,175 INFO L87 Difference]: Start difference. First operand 11472 states and 17687 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 12:28:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:28:52,825 INFO L93 Difference]: Finished difference Result 26073 states and 40497 transitions. [2022-07-12 12:28:52,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 12:28:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 137 [2022-07-12 12:28:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:28:52,887 INFO L225 Difference]: With dead ends: 26073 [2022-07-12 12:28:52,887 INFO L226 Difference]: Without dead ends: 14643 [2022-07-12 12:28:52,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-07-12 12:28:52,923 INFO L413 NwaCegarLoop]: 2315 mSDtfsCounter, 2548 mSDsluCounter, 20148 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2639 SdHoareTripleChecker+Valid, 22463 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:28:52,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2639 Valid, 22463 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 12:28:52,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14643 states. [2022-07-12 12:28:53,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14643 to 11460. [2022-07-12 12:28:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11460 states, 8327 states have (on average 1.3364957367599375) internal successors, (11129), 8671 states have internal predecessors, (11129), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2305 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-12 12:28:53,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11460 states to 11460 states and 17670 transitions. [2022-07-12 12:28:53,541 INFO L78 Accepts]: Start accepts. Automaton has 11460 states and 17670 transitions. Word has length 137 [2022-07-12 12:28:53,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:28:53,541 INFO L495 AbstractCegarLoop]: Abstraction has 11460 states and 17670 transitions. [2022-07-12 12:28:53,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 12:28:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 11460 states and 17670 transitions. [2022-07-12 12:28:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 12:28:53,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:28:53,549 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:28:53,582 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-12 12:28:53,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:28:53,759 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:28:53,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:28:53,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1052789049, now seen corresponding path program 1 times [2022-07-12 12:28:53,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:28:53,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751311948] [2022-07-12 12:28:53,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:28:53,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:28:53,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:28:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:28:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:28:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:28:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:28:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:28:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:28:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:28:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:53,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:28:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:54,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:54,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 12:28:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 12:28:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:28:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:28:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:54,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:28:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:28:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-12 12:28:54,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:28:54,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751311948] [2022-07-12 12:28:54,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751311948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:28:54,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:28:54,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 12:28:54,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824638026] [2022-07-12 12:28:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:28:54,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:28:54,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:28:54,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:28:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:28:54,042 INFO L87 Difference]: Start difference. First operand 11460 states and 17670 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 4 states have internal predecessors, (98), 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-12 12:28:56,185 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-12 12:28:58,226 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-12 12:29:01,158 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-12 12:29:03,195 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-12 12:29:05,530 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-12 12:29:07,572 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-12 12:29:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:10,903 INFO L93 Difference]: Finished difference Result 29846 states and 46823 transitions. [2022-07-12 12:29:10,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 12:29:10,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 4 states have internal predecessors, (98), 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 158 [2022-07-12 12:29:10,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:10,974 INFO L225 Difference]: With dead ends: 29846 [2022-07-12 12:29:10,974 INFO L226 Difference]: Without dead ends: 18428 [2022-07-12 12:29:11,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:29:11,010 INFO L413 NwaCegarLoop]: 1725 mSDtfsCounter, 1770 mSDsluCounter, 5150 mSDsCounter, 0 mSdLazyCounter, 2490 mSolverCounterSat, 891 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 6875 SdHoareTripleChecker+Invalid, 3387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 891 IncrementalHoareTripleChecker+Valid, 2490 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:11,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 6875 Invalid, 3387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [891 Valid, 2490 Invalid, 6 Unknown, 0 Unchecked, 16.0s Time] [2022-07-12 12:29:11,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2022-07-12 12:29:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 11476. [2022-07-12 12:29:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11476 states, 8343 states have (on average 1.3358504135203164) internal successors, (11145), 8687 states have internal predecessors, (11145), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2305 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-12 12:29:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11476 states to 11476 states and 17686 transitions. [2022-07-12 12:29:11,656 INFO L78 Accepts]: Start accepts. Automaton has 11476 states and 17686 transitions. Word has length 158 [2022-07-12 12:29:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:11,656 INFO L495 AbstractCegarLoop]: Abstraction has 11476 states and 17686 transitions. [2022-07-12 12:29:11,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 4 states have internal predecessors, (98), 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-12 12:29:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 11476 states and 17686 transitions. [2022-07-12 12:29:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 12:29:11,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:11,663 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-12 12:29:11,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 12:29:11,663 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:11,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1339354368, now seen corresponding path program 1 times [2022-07-12 12:29:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659623677] [2022-07-12 12:29:11,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:11,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-12 12:29:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-12 12:29:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-12 12:29:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 12:29:11,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 12:29:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-12 12:29:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 12:29:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 12:29:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 12:29:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 12:29:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 12:29:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 12:29:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 12:29:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:11,978 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-12 12:29:11,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 12:29:11,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659623677] [2022-07-12 12:29:11,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659623677] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 12:29:11,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832078680] [2022-07-12 12:29:11,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:11,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 12:29:11,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:29:11,981 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-12 12:29:11,989 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-12 12:29:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:12,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 2393 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 12:29:12,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:12,872 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 12:29:12,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:29:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-07-12 12:29:13,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832078680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:29:13,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 12:29:13,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 15 [2022-07-12 12:29:13,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491688591] [2022-07-12 12:29:13,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 12:29:13,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 12:29:13,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 12:29:13,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 12:29:13,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-07-12 12:29:13,031 INFO L87 Difference]: Start difference. First operand 11476 states and 17686 transitions. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 10 states have internal predecessors, (139), 2 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 12:29:15,364 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-12 12:29:17,400 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-12 12:29:19,431 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-12 12:29:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:23,847 INFO L93 Difference]: Finished difference Result 24491 states and 37816 transitions. [2022-07-12 12:29:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 12:29:23,848 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 10 states have internal predecessors, (139), 2 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 153 [2022-07-12 12:29:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:23,912 INFO L225 Difference]: With dead ends: 24491 [2022-07-12 12:29:23,912 INFO L226 Difference]: Without dead ends: 13021 [2022-07-12 12:29:23,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=443, Unknown=0, NotChecked=0, Total=600 [2022-07-12 12:29:23,950 INFO L413 NwaCegarLoop]: 1153 mSDtfsCounter, 928 mSDsluCounter, 4516 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 958 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 5669 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 958 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:23,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [953 Valid, 5669 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [958 Valid, 2347 Invalid, 3 Unknown, 0 Unchecked, 9.9s Time] [2022-07-12 12:29:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2022-07-12 12:29:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 11487. [2022-07-12 12:29:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11487 states, 8354 states have (on average 1.3354081876945176) internal successors, (11156), 8698 states have internal predecessors, (11156), 2250 states have call successors, (2250), 556 states have call predecessors, (2250), 882 states have return successors, (4291), 2305 states have call predecessors, (4291), 2247 states have call successors, (4291) [2022-07-12 12:29:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11487 states to 11487 states and 17697 transitions. [2022-07-12 12:29:24,559 INFO L78 Accepts]: Start accepts. Automaton has 11487 states and 17697 transitions. Word has length 153 [2022-07-12 12:29:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:24,559 INFO L495 AbstractCegarLoop]: Abstraction has 11487 states and 17697 transitions. [2022-07-12 12:29:24,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 10 states have internal predecessors, (139), 2 states have call successors, (38), 7 states have call predecessors, (38), 5 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-12 12:29:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 11487 states and 17697 transitions. [2022-07-12 12:29:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 12:29:24,565 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:24,565 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2022-07-12 12:29:24,591 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-12 12:29:24,791 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,SelfDestructingSolverStorable15 [2022-07-12 12:29:24,792 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:24,792 INFO L85 PathProgramCache]: Analyzing trace with hash 436590142, now seen corresponding path program 2 times [2022-07-12 12:29:24,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 12:29:24,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726925434] [2022-07-12 12:29:24,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:24,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 12:29:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 12:29:25,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 12:29:25,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 12:29:25,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 12:29:25,334 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 12:29:25,334 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 12:29:25,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 12:29:25,338 INFO L356 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:29:25,341 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 12:29:25,368 WARN L418 cessorBacktranslator]: Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) [2022-07-12 12:29:25,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 12:29:25 BoogieIcfgContainer [2022-07-12 12:29:25,532 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 12:29:25,532 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 12:29:25,532 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 12:29:25,533 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 12:29:25,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:27:03" (3/4) ... [2022-07-12 12:29:25,535 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 12:29:25,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 12:29:25,535 INFO L158 Benchmark]: Toolchain (without parser) took 147958.40ms. Allocated memory was 104.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 54.2MB in the beginning and 400.9MB in the end (delta: -346.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-12 12:29:25,535 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 12:29:25,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1430.66ms. Allocated memory was 104.9MB in the beginning and 201.3MB in the end (delta: 96.5MB). Free memory was 53.9MB in the beginning and 115.8MB in the end (delta: -61.8MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2022-07-12 12:29:25,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.73ms. Allocated memory is still 201.3MB. Free memory was 115.8MB in the beginning and 98.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 12:29:25,536 INFO L158 Benchmark]: Boogie Preprocessor took 172.73ms. Allocated memory is still 201.3MB. Free memory was 98.0MB in the beginning and 127.5MB in the end (delta: -29.5MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2022-07-12 12:29:25,536 INFO L158 Benchmark]: RCFGBuilder took 4507.55ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 127.5MB in the beginning and 164.4MB in the end (delta: -36.9MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2022-07-12 12:29:25,537 INFO L158 Benchmark]: TraceAbstraction took 141684.70ms. Allocated memory was 302.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 163.3MB in the beginning and 400.9MB in the end (delta: -237.6MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2022-07-12 12:29:25,537 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 1.6GB. Free memory is still 400.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 12:29:25,538 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.16ms. Allocated memory is still 104.9MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1430.66ms. Allocated memory was 104.9MB in the beginning and 201.3MB in the end (delta: 96.5MB). Free memory was 53.9MB in the beginning and 115.8MB in the end (delta: -61.8MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.73ms. Allocated memory is still 201.3MB. Free memory was 115.8MB in the beginning and 98.0MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 172.73ms. Allocated memory is still 201.3MB. Free memory was 98.0MB in the beginning and 127.5MB in the end (delta: -29.5MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * RCFGBuilder took 4507.55ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 127.5MB in the beginning and 164.4MB in the end (delta: -36.9MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * TraceAbstraction took 141684.70ms. Allocated memory was 302.0MB in the beginning and 1.6GB in the end (delta: 1.3GB). Free memory was 163.3MB in the beginning and 400.9MB in the end (delta: -237.6MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 1.6GB. Free memory is still 400.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification free ensures #res.base == #ptr.base && #res.offset == #ptr.offset; is not ensure(true) * 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: 7054]: 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 8527. Possible FailurePath: [L7077] int LDV_IN_INTERRUPT = 1; [L7078] struct usb_interface *mwifiex_usb_driver_group1 ; [L7079] int ldv_state_variable_2 ; [L7080] int ref_cnt ; [L7081] struct mwifiex_adapter *usb_ops_group0 ; [L7082] int ldv_state_variable_1 ; [L7083] int usb_counter ; [L7084] struct sk_buff *usb_ops_group1 ; [L7085] int ldv_state_variable_0 ; [L7166-L7168] static char const usbdriver_name[8U] = { 'u', 's', 'b', '8', '7', '9', '7', '\000'}; [L7170] static struct semaphore add_remove_card_sem ; [L7171] static struct usb_card_rec *usb_card ; [L7172-L7176] static struct usb_device_id mwifiex_usb_table[3U] = { {3U, 4742U, 8259U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 0UL}, {899U, 4742U, 8260U, (unsigned short)0, (unsigned short)0, (unsigned char)0, (unsigned char)0, (unsigned char)0, 255U, 255U, 255U, (unsigned char)0, 0UL}}; [L7177] struct usb_device_id const __mod_usb_device_table ; [L8001-L8007] static struct usb_driver mwifiex_usb_driver = {(char const *)(& usbdriver_name), & mwifiex_usb_probe, & mwifiex_usb_disconnect, 0, & mwifiex_usb_suspend, & mwifiex_usb_resume, 0, 0, 0, (struct usb_device_id const *)(& mwifiex_usb_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, 0}, 0}, (unsigned char)0, 1U, (unsigned char)0, (unsigned char)0}; [L8502-L8506] static struct mwifiex_if_ops usb_ops = {0, 0, 0, 0, & mwifiex_register_dev, & mwifiex_unregister_dev, 0, 0, 0, & mwifiex_usb_host_to_card, & mwifiex_pm_wakeup_card, & mwifiex_pm_wakeup_card_complete, 0, 0, & mwifiex_usb_cmd_event_complete, & mwifiex_usb_cmd_event_complete, & mwifiex_usb_data_complete, 0, & mwifiex_usb_dnld_fw, 0, 0}; [L8586] int ldv_retval_0 ; [L8587] int ldv_retval_4 ; [L8588] int ldv_retval_1 ; [L8592] int ldv_retval_3 ; [L8593] int ldv_retval_2 ; [L8989] int INTERF_STATE = 0; [L8990] int SERIAL_STATE = 0; [L8991] void *usb_intfdata = 0; [L8992] struct urb *usb_urb = 0; [L8993] struct usb_device *usb_dev = 0; [L8994] int dev_counter = 0; [L8995] int completeFnIntCounter = 0; [L8996] int completeFnBulkCounter = 0; [L8997] void (*completeFnInt)(struct urb * ) ; [L8998] void (*completeFnBulk)(struct urb * ) ; VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8617] u8 ldvarg1 ; [L8618] u8 tmp ; [L8619] struct mwifiex_tx_param *ldvarg0 ; [L8620] void *tmp___0 ; [L8621] struct mwifiex_fw_image *ldvarg2 ; [L8622] void *tmp___1 ; [L8623] struct usb_device_id *ldvarg4 ; [L8624] void *tmp___2 ; [L8625] pm_message_t ldvarg3 ; [L8626] int tmp___3 ; [L8627] int tmp___4 ; [L8628] int tmp___5 ; [L8629] int tmp___6 ; [L8631] tmp = __VERIFIER_nondet_u8() [L8632] ldvarg1 = tmp VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg1=59, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8633] CALL, EXPR ldv_zalloc(4UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=4, \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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=4, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8633] RET, EXPR ldv_zalloc(4UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(4UL)={0:0}, ldvarg1=59, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8633] tmp___0 = ldv_zalloc(4UL) [L8634] ldvarg0 = (struct mwifiex_tx_param *)tmp___0 VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8635] CALL, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=32, \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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=32, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8635] RET, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(32UL)={0:0}, ldvarg0={0:0}, ldvarg1=59, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8635] tmp___1 = ldv_zalloc(32UL) [L8636] ldvarg2 = (struct mwifiex_fw_image *)tmp___1 VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8637] CALL, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=32, \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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=32, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8637] RET, EXPR ldv_zalloc(32UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldv_zalloc(32UL)={0:0}, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8637] tmp___2 = ldv_zalloc(32UL) [L8638] ldvarg4 = (struct usb_device_id *)tmp___2 [L8639] FCALL ldv_initialize() [L8640] FCALL memset((void *)(& ldvarg3), 0, 4UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=0, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, memset((void *)(& ldvarg3), 0, 4UL)={169:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8641] ldv_state_variable_1 = 0 [L8642] ref_cnt = 0 [L8643] ldv_state_variable_0 = 1 [L8644] ldv_state_variable_2 = 0 VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8646] tmp___3 = __VERIFIER_nondet_int() [L8648] case 0: [L8722] case 1: VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8723] COND TRUE ldv_state_variable_0 != 0 [L8724] tmp___5 = __VERIFIER_nondet_int() [L8726] case 0: [L8734] case 1: VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8735] COND TRUE ldv_state_variable_0 == 1 [L8736] CALL, EXPR mwifiex_usb_init_module() [L8509] int ret ; [L8510] struct _ddebug descriptor ; [L8511] long tmp ; [L8512] struct _ddebug descriptor___0 ; [L8513] long tmp___0 ; [L8515] descriptor.modname = "mwifiex_usb" [L8516] descriptor.function = "mwifiex_usb_init_module" [L8517] descriptor.filename = "/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6606/dscv_tempdir/dscv/ri/144_2a/drivers/net/wireless/mwifiex/usb.o.c.prepared" [L8518] descriptor.format = "Marvell USB8797 Driver\n" [L8519] descriptor.lineno = 1030U [L8520] descriptor.flags = 0U [L8521] EXPR descriptor.flags VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor.flags=0, descriptor___0={166:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8521] CALL, EXPR ldv__builtin_expect((long )descriptor.flags & 1L, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7067] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8521] RET, EXPR ldv__builtin_expect((long )descriptor.flags & 1L, 0L) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor.flags=0, descriptor___0={166:0}, dev_counter=0, INTERF_STATE=0, ldv__builtin_expect((long )descriptor.flags & 1L, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8521] tmp = ldv__builtin_expect((long )descriptor.flags & 1L, 0L) [L8522] COND FALSE !(tmp != 0L) VAL [={0:0}, ={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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor___0={166:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8526] CALL sema_init(& add_remove_card_sem, 1) [L6892] struct lock_class_key __key ; [L6893] struct semaphore __constr_expr_0 ; [L6895] __constr_expr_0.lock.raw_lock.ldv_2243.head_tail = 0U [L6896] __constr_expr_0.lock.magic = 3735899821U [L6897] __constr_expr_0.lock.owner_cpu = 4294967295U [L6898] __constr_expr_0.lock.owner = (void *)-1 [L6899] __constr_expr_0.lock.dep_map.key = 0 [L6900] __constr_expr_0.lock.dep_map.class_cache[0] = 0 [L6901] __constr_expr_0.lock.dep_map.class_cache[1] = 0 [L6902] __constr_expr_0.lock.dep_map.name = "(*sem).lock" [L6903] __constr_expr_0.lock.dep_map.cpu = 0 [L6904] __constr_expr_0.lock.dep_map.ip = 0UL [L6905] __constr_expr_0.count = (unsigned int )val [L6906] __constr_expr_0.wait_list.next = & sem->wait_list [L6907] __constr_expr_0.wait_list.prev = & sem->wait_list [L6908] *sem = __constr_expr_0 [L6909] FCALL lockdep_init_map(& sem->lock.dep_map, "semaphore->lock", & __key, 0) [L6910] return; [L6910] return; VAL [={0:0}, ={0:0}, \old(val)=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, __mod_usb_device_table=0, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, sem={161:0}, sem={161:0}, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}, val=1] [L8526] RET sema_init(& add_remove_card_sem, 1) [L8527] CALL, EXPR ldv_usb_register_driver_22(& mwifiex_usb_driver, & __this_module, "mwifiex_usb") [L8961] ldv_func_ret_type ldv_func_res ; [L8962] int tmp ; [L8964] CALL, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L9357] return __VERIFIER_nondet_int(); [L8964] RET, EXPR usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L8964] tmp = usb_register_driver(ldv_func_arg1, ldv_func_arg2, ldv_func_arg3) [L8965] ldv_func_res = tmp [L8966] ldv_state_variable_2 = 1 [L8967] usb_counter = 0 [L8968] CALL ldv_usb_driver_2() [L8596] void *tmp ; VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8598] CALL, EXPR ldv_zalloc(1520UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=1520, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=1520, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8598] RET, EXPR ldv_zalloc(1520UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, ldv_zalloc(1520UL)={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8598] tmp = ldv_zalloc(1520UL) [L8599] mwifiex_usb_driver_group1 = (struct usb_interface *)tmp VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8968] RET ldv_usb_driver_2() [L8969] return (ldv_func_res); VAL [={0:0}, ={0:0}, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, ldv_func_arg1={163:0}, ldv_func_arg1={163:0}, ldv_func_arg2={4294967313:4294967299}, ldv_func_arg2={4294967313:4294967299}, ldv_func_arg3={153:0}, ldv_func_arg3={153:0}, ldv_func_res=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8527] RET, EXPR ldv_usb_register_driver_22(& mwifiex_usb_driver, & __this_module, "mwifiex_usb") [L8527] ret = ldv_usb_register_driver_22(& mwifiex_usb_driver, & __this_module, "mwifiex_usb") [L8528] COND FALSE !(ret != 0) [L8531] descriptor___0.modname = "mwifiex_usb" [L8532] descriptor___0.function = "mwifiex_usb_init_module" [L8533] descriptor___0.filename = "/work/ldvuser/mutilin/launch/work/current--X--drivers--X--defaultlinux-3.12-rc1.tar.xz--X--144_2a--X--cpachecker/linux-3.12-rc1.tar.xz/csd_deg_dscv/6606/dscv_tempdir/dscv/ri/144_2a/drivers/net/wireless/mwifiex/usb.o.c.prepared" [L8534] descriptor___0.format = "info: Driver registered successfully!\n" [L8535] descriptor___0.lineno = 1038U [L8536] descriptor___0.flags = 0U [L8537] EXPR descriptor___0.flags VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor___0={166:0}, descriptor___0.flags=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=0, SERIAL_STATE=0, tmp=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8537] CALL, EXPR ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7067] return (exp); VAL [={0:0}, ={0:0}, \old(c)=0, \old(exp)=0, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, c=0, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, exp=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8537] RET, EXPR ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor___0={166:0}, descriptor___0.flags=0, dev_counter=0, INTERF_STATE=0, ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L)=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=0, SERIAL_STATE=0, tmp=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8537] tmp___0 = ldv__builtin_expect((long )descriptor___0.flags & 1L, 0L) [L8538] COND FALSE !(tmp___0 != 0L) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, descriptor={165:0}, descriptor___0={166:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=0, SERIAL_STATE=0, tmp=0, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8543] return (ret); [L8543] return (ret); [L8543] return (ret); VAL [={0:0}, ={0:0}, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=1, ldv_state_variable_1=0, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=0, SERIAL_STATE=0, tmp=0, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8736] RET, EXPR mwifiex_usb_init_module() [L8736] ldv_retval_0 = mwifiex_usb_init_module() [L8737] COND TRUE ldv_retval_0 == 0 [L8738] ldv_state_variable_0 = 3 [L8739] ldv_state_variable_1 = 1 [L8740] CALL ldv_initialize_mwifiex_if_ops_1() [L8605] void *tmp ; [L8606] void *tmp___0 ; VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8608] CALL, EXPR ldv_zalloc(5920UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=5920, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=5920, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8608] RET, EXPR ldv_zalloc(5920UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(5920UL)={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8608] tmp = ldv_zalloc(5920UL) [L8609] usb_ops_group0 = (struct mwifiex_adapter *)tmp VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8610] CALL, EXPR ldv_zalloc(240UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7019] void *p ; [L7020] void *tmp ; [L7021] int tmp___0 ; [L7023] tmp___0 = __VERIFIER_nondet_int() [L7024] COND TRUE tmp___0 != 0 [L7025] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=240, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=240, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8610] RET, EXPR ldv_zalloc(240UL) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_zalloc(240UL)={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8610] tmp___0 = ldv_zalloc(240UL) [L8611] usb_ops_group1 = (struct sk_buff *)tmp___0 VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, tmp___0={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8740] RET ldv_initialize_mwifiex_if_ops_1() [L8743] COND FALSE !(ldv_retval_0 != 0) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8646] tmp___3 = __VERIFIER_nondet_int() [L8648] case 0: VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=0, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8649] COND TRUE ldv_state_variable_1 != 0 [L8650] tmp___4 = __VERIFIER_nondet_int() [L8652] case 0: [L8659] case 1: [L8666] case 2: [L8673] case 3: [L8680] case 4: [L8687] case 5: VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=0, tmp___4=5, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8688] COND TRUE ldv_state_variable_1 == 1 [L8689] CALL mwifiex_usb_dnld_fw(usb_ops_group0, ldvarg2) [L8435] int ret ; [L8436] struct usb_card_rec *card ; [L8438] EXPR adapter->card [L8438] card = (struct usb_card_rec *)adapter->card [L8439] EXPR card->usb_boot_state VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, card->usb_boot_state=171, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, fw={0:0}, fw={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8439] COND FALSE !((unsigned int )card->usb_boot_state == 1U) [L8451] CALL, EXPR mwifiex_usb_rx_init(adapter) [L8045] struct usb_card_rec *card ; [L8046] int i ; [L8047] int tmp ; [L8048] int tmp___0 ; [L8050] EXPR adapter->card [L8050] card = (struct usb_card_rec *)adapter->card [L8051] card->rx_cmd.adapter = adapter [L8052] EXPR card->rx_cmd_ep [L8052] card->rx_cmd.ep = card->rx_cmd_ep [L8053] CALL, EXPR ldv_usb_alloc_urb_17(0, 208U) [L8936] struct urb *tmp ; VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mem_flags=208, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L8938] CALL, EXPR ldv_alloc_urb() VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9021] struct urb *value ; [L9022] void *tmp ; [L9023] int tmp___0 ; VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9025] CALL, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(size)=184, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7002] void *p ; [L7003] void *tmp ; [L7004] int tmp___0 ; [L7006] tmp___0 = __VERIFIER_nondet_int() [L7007] COND FALSE !(tmp___0 != 0) [L7010] tmp = malloc(size) [L7011] p = tmp VAL [={0:0}, ={0:0}, \old(size)=184, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=184, tmp={-18446744073709551617:0}, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7012] CALL assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(cond)=1, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L6998] COND FALSE !(!cond) VAL [={0:0}, ={0:0}, \old(cond)=1, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, cond=1, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7012] RET assume_abort_if_not((unsigned long )p != (unsigned long )((void *)0)) VAL [={0:0}, ={0:0}, \old(size)=184, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=184, tmp={-18446744073709551617:0}, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7013] return (p); VAL [={0:0}, ={0:0}, \old(size)=184, \old(usb_urb)=0, \old(usb_urb)=0, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, p={-18446744073709551617:0}, ref_cnt=0, SERIAL_STATE=0, size=184, tmp={-18446744073709551617:0}, tmp___0=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9025] RET, EXPR ldv_malloc(sizeof(struct urb)) VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct urb))={-18446744073709551617:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9025] tmp = ldv_malloc(sizeof(struct urb)) [L9026] value = tmp VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L9027] CALL, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L7036] int tmp ; [L7038] tmp = __VERIFIER_nondet_int() [L7039] return (tmp); VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, \result=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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}] [L9027] RET, EXPR ldv_undef_int() VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldv_undef_int()=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L9027] tmp___0 = ldv_undef_int() [L9028] COND TRUE \read(tmp___0) VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={0:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L9029] COND TRUE (unsigned long )value != (unsigned long )((struct urb *)0) [L9030] usb_urb = value VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L9035] return (usb_urb); VAL [={0:0}, ={0:0}, \old(usb_urb)=0, \old(usb_urb)=0, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}, value={-18446744073709551617:0}] [L8938] RET, EXPR ldv_alloc_urb() VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, ldv_alloc_urb()={-18446744073709551617:0}, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mem_flags=208, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8938] tmp = ldv_alloc_urb() [L8939] return (tmp); VAL [={0:0}, ={0:0}, \old(iso_packets)=0, \old(mem_flags)=208, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, iso_packets=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mem_flags=208, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={-18446744073709551617:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8053] RET, EXPR ldv_usb_alloc_urb_17(0, 208U) [L8053] card->rx_cmd.urb = ldv_usb_alloc_urb_17(0, 208U) [L8054] EXPR card->rx_cmd.urb VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, card->rx_cmd.urb={-18446744073709551617:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8054] COND FALSE !((unsigned long )card->rx_cmd.urb == (unsigned long )((struct urb *)0)) [L8059] CALL, EXPR dev_alloc_skb(2048U) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7104] struct sk_buff *tmp ; [L7106] CALL, EXPR netdev_alloc_skb((struct net_device *)0, length) [L7096] struct sk_buff *tmp ; [L7098] CALL, EXPR __netdev_alloc_skb(dev, length, 32U) [L9240] CALL, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [={0:0}, ={0:0}, \old(size)=253, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7002] void *p ; [L7003] void *tmp ; [L7004] int tmp___0 ; [L7006] tmp___0 = __VERIFIER_nondet_int() [L7007] COND TRUE tmp___0 != 0 [L7008] return ((void *)0); VAL [={0:0}, ={0:0}, \old(size)=253, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, size=253, tmp___0=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L9240] RET, EXPR ldv_malloc(sizeof(struct sk_buff)) VAL [={0:0}, ={0:0}, \old(arg1)=2048, \old(arg2)=32, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, arg0={0:0}, arg0={0:0}, arg1=2048, arg2=32, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_malloc(sizeof(struct sk_buff))={0:0}, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L9240] struct sk_buff *skb = ldv_malloc(sizeof(struct sk_buff)); [L9241] COND FALSE !(\read(*skb)) VAL [={0:0}, ={0:0}, \old(arg1)=2048, \old(arg2)=32, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, add_remove_card_sem={161:0}, arg0={0:0}, arg0={0:0}, arg1=2048, arg2=32, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, skb={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L9247] return skb; VAL [={0:0}, ={0:0}, \old(arg1)=2048, \old(arg2)=32, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, arg0={0:0}, arg0={0:0}, arg1=2048, arg2=32, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, skb={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7098] RET, EXPR __netdev_alloc_skb(dev, length, 32U) [L7098] tmp = __netdev_alloc_skb(dev, length, 32U) [L7099] return (tmp); VAL [={0:0}, ={0:0}, \old(length)=2048, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev={0:0}, dev={0:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, length=2048, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7106] RET, EXPR netdev_alloc_skb((struct net_device *)0, length) [L7106] tmp = netdev_alloc_skb((struct net_device *)0, length) [L7107] return (tmp); VAL [={0:0}, ={0:0}, \old(length)=2048, \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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, length=2048, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp={0:0}, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8059] RET, EXPR dev_alloc_skb(2048U) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_alloc_skb(2048U)={0:0}, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8059] card->rx_cmd.skb = dev_alloc_skb(2048U) [L8060] EXPR card->rx_cmd.skb VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, card->rx_cmd.skb={0:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8060] COND TRUE (unsigned long )card->rx_cmd.skb == (unsigned long )((struct sk_buff *)0) [L8061] adapter->dev [L8062] return (-12); VAL [={0:0}, ={0:0}, \result=-12, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8451] RET, EXPR mwifiex_usb_rx_init(adapter) [L8451] ret = mwifiex_usb_rx_init(adapter) [L8452] COND FALSE !(ret == 0) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, fw={0:0}, fw={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=-12, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8456] return (ret); VAL [={0:0}, ={0:0}, \result=-12, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_usb_device_table=0, __mod_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={4294967313:4294967299}, adapter={0:0}, adapter={0:0}, add_remove_card_sem={161:0}, card={4294967304:-206}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, fw={0:0}, fw={0:0}, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, ret=-12, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8689] RET mwifiex_usb_dnld_fw(usb_ops_group0, ldvarg2) [L8690] ldv_state_variable_1 = 1 VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=0, tmp___4=5, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8646] tmp___3 = __VERIFIER_nondet_int() [L8648] case 0: [L8722] case 1: VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___4=5, tmp___5=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8723] COND TRUE ldv_state_variable_0 != 0 [L8724] tmp___5 = __VERIFIER_nondet_int() [L8726] case 0: VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___4=5, tmp___5=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8727] COND TRUE ldv_state_variable_0 == 3 && ref_cnt == 0 [L8728] CALL mwifiex_usb_cleanup_module() [L8548] int tmp ; [L8549] struct mwifiex_adapter *adapter ; [L8550] int i ; [L8551] struct mwifiex_private *tmp___0 ; [L8553] CALL, EXPR down_interruptible(& add_remove_card_sem) [L9262] return __VERIFIER_nondet_int(); [L8553] RET, EXPR down_interruptible(& add_remove_card_sem) [L8553] tmp = down_interruptible(& add_remove_card_sem) [L8554] COND FALSE !(tmp == 0) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8558] COND FALSE !((unsigned long )usb_card != (unsigned long )((struct usb_card_rec *)0)) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=1, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8582] CALL ldv_usb_deregister_23(& mwifiex_usb_driver) [L8975] FCALL usb_deregister(arg) [L8976] ldv_state_variable_2 = 0 VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, arg={163:0}, arg={163:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8582] RET ldv_usb_deregister_23(& mwifiex_usb_driver) [L8728] RET mwifiex_usb_cleanup_module() [L8729] ldv_state_variable_0 = 2 VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, ldvarg0={0:0}, ldvarg1=59, ldvarg2={0:0}, ldvarg3={169:0}, ldvarg4={0:0}, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, tmp=59, tmp___0={0:0}, tmp___1={0:0}, tmp___2={0:0}, tmp___3=1, tmp___4=5, tmp___5=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L8830] CALL ldv_check_final_state() [L9208] COND FALSE !((unsigned long )usb_urb == (unsigned long )((struct urb *)0)) VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L9210] CALL ldv_error() VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] [L7054] reach_error() VAL [={0:0}, ={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, __mod_usb_device_table=0, __this_module={4294967313:4294967299}, add_remove_card_sem={161:0}, completeFnBulkCounter=0, completeFnIntCounter=0, dev_counter=0, INTERF_STATE=0, LDV_IN_INTERRUPT=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_retval_3=0, ldv_retval_4=0, ldv_state_variable_0=2, ldv_state_variable_1=1, ldv_state_variable_2=0, mwifiex_usb_driver={163:0}, mwifiex_usb_driver_group1={0:0}, mwifiex_usb_table={162:0}, ref_cnt=0, SERIAL_STATE=0, usb_card={0:0}, usb_counter=0, usb_dev={0:0}, usb_intfdata={0:0}, usb_ops={164:0}, usb_ops_group0={0:0}, usb_ops_group1={0:0}, usb_urb={-18446744073709551617:0}, usbdriver_name={160:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 45 procedures, 857 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 141.4s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 123.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 36 mSolverCounterUnknown, 24883 SdHoareTripleChecker+Valid, 114.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23287 mSDsluCounter, 90690 SdHoareTripleChecker+Invalid, 107.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68977 mSDsCounter, 12304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22743 IncrementalHoareTripleChecker+Invalid, 35083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12304 mSolverCounterUnsat, 21713 mSDtfsCounter, 22743 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1318 GetRequests, 1137 SyntacticMatches, 1 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12466occurred in iteration=9, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 22542 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2550 NumberOfCodeBlocks, 2550 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2525 ConstructedInterpolants, 0 QuantifiedInterpolants, 4867 SizeOfPredicates, 41 NumberOfNonLiveVariables, 11427 ConjunctsInSsa, 150 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 1228/1235 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-12 12:29:25,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.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 9f2fac8642c25f1335350a2814ff7cf3c4ea0fb7f4feaed63baec564397e8f24 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 12:29:27,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 12:29:27,394 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 12:29:27,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 12:29:27,416 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 12:29:27,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 12:29:27,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 12:29:27,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 12:29:27,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 12:29:27,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 12:29:27,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 12:29:27,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 12:29:27,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 12:29:27,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 12:29:27,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 12:29:27,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 12:29:27,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 12:29:27,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 12:29:27,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 12:29:27,436 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 12:29:27,441 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 12:29:27,442 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 12:29:27,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 12:29:27,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 12:29:27,446 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 12:29:27,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 12:29:27,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 12:29:27,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 12:29:27,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 12:29:27,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 12:29:27,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 12:29:27,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 12:29:27,457 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 12:29:27,457 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 12:29:27,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 12:29:27,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 12:29:27,462 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 12:29:27,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 12:29:27,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 12:29:27,463 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 12:29:27,463 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 12:29:27,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 12:29:27,466 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 12:29:27,502 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 12:29:27,502 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 12:29:27,502 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 12:29:27,502 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 12:29:27,503 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 12:29:27,503 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 12:29:27,504 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 12:29:27,504 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 12:29:27,504 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 12:29:27,504 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 12:29:27,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 12:29:27,505 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 12:29:27,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 12:29:27,506 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 12:29:27,506 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 12:29:27,506 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 12:29:27,506 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 12:29:27,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 12:29:27,507 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 12:29:27,507 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 12:29:27,507 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 12:29:27,507 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 12:29:27,508 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 12:29:27,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:29:27,508 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 12:29:27,508 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 12:29:27,509 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 12:29:27,509 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 12:29:27,509 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 12:29:27,509 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 12:29:27,509 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 12:29:27,510 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 12:29:27,510 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 12:29:27,510 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 -> 9f2fac8642c25f1335350a2814ff7cf3c4ea0fb7f4feaed63baec564397e8f24 [2022-07-12 12:29:27,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 12:29:27,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 12:29:27,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 12:29:27,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 12:29:27,786 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 12:29:27,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-12 12:29:27,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e85a69a/b7dcf63b0a7742b38e5c3d6e575e5b2e/FLAGbe35c474d [2022-07-12 12:29:28,482 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 12:29:28,482 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-12 12:29:28,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e85a69a/b7dcf63b0a7742b38e5c3d6e575e5b2e/FLAGbe35c474d [2022-07-12 12:29:28,875 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e85a69a/b7dcf63b0a7742b38e5c3d6e575e5b2e [2022-07-12 12:29:28,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 12:29:28,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 12:29:28,879 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 12:29:28,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 12:29:28,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 12:29:28,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:29:28" (1/1) ... [2022-07-12 12:29:28,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c04d9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:28, skipping insertion in model container [2022-07-12 12:29:28,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 12:29:28" (1/1) ... [2022-07-12 12:29:28,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 12:29:28,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:29:29,610 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-12 12:29:29,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:29:30,015 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 12:29:30,062 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 12:29:30,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-12 12:29:30,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:29:30,259 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 12:29:30,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i[202214,202227] [2022-07-12 12:29:30,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 12:29:30,574 INFO L208 MainTranslator]: Completed translation [2022-07-12 12:29:30,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30 WrapperNode [2022-07-12 12:29:30,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 12:29:30,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 12:29:30,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 12:29:30,576 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 12:29:30,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,732 INFO L137 Inliner]: procedures = 178, calls = 1186, calls flagged for inlining = 76, calls inlined = 76, statements flattened = 2976 [2022-07-12 12:29:30,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 12:29:30,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 12:29:30,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 12:29:30,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 12:29:30,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,833 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 12:29:30,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 12:29:30,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 12:29:30,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 12:29:30,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (1/1) ... [2022-07-12 12:29:30,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 12:29:30,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 12:29:30,898 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-12 12:29:30,919 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-12 12:29:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-12 12:29:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-12 12:29:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_unregister_dev [2022-07-12 12:29:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_unregister_dev [2022-07-12 12:29:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_bulk_urb_2 [2022-07-12 12:29:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_bulk_urb_2 [2022-07-12 12:29:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-12 12:29:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure skb_copy_from_linear_data [2022-07-12 12:29:30,935 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_copy_from_linear_data [2022-07-12 12:29:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2022-07-12 12:29:30,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2022-07-12 12:29:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-12 12:29:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 12:29:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 12:29:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2022-07-12 12:29:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 12:29:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-12 12:29:30,936 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-12 12:29:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 12:29:30,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 12:29:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-07-12 12:29:30,936 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-07-12 12:29:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-07-12 12:29:30,936 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-07-12 12:29:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2022-07-12 12:29:30,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2022-07-12 12:29:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 12:29:30,937 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 12:29:30,937 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_disconnect [2022-07-12 12:29:30,937 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_disconnect [2022-07-12 12:29:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 12:29:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 12:29:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 12:29:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 12:29:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2022-07-12 12:29:30,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2022-07-12 12:29:30,938 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 12:29:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 12:29:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_get_priv [2022-07-12 12:29:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_get_priv [2022-07-12 12:29:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_submit_rx_urb [2022-07-12 12:29:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_submit_rx_urb [2022-07-12 12:29:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 12:29:30,939 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 12:29:30,939 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-07-12 12:29:30,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-07-12 12:29:30,940 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_rx_complete [2022-07-12 12:29:30,940 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_rx_complete [2022-07-12 12:29:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2022-07-12 12:29:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-12 12:29:30,941 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-12 12:29:30,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2022-07-12 12:29:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2022-07-12 12:29:30,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2022-07-12 12:29:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure dev_alloc_skb [2022-07-12 12:29:30,943 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_alloc_skb [2022-07-12 12:29:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 12:29:30,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 12:29:30,943 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-12 12:29:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-12 12:29:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 12:29:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 12:29:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 12:29:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 12:29:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 12:29:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2022-07-12 12:29:30,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2022-07-12 12:29:30,944 INFO L130 BoogieDeclarations]: Found specification of procedure dev_kfree_skb_any [2022-07-12 12:29:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_kfree_skb_any [2022-07-12 12:29:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 12:29:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2022-07-12 12:29:30,945 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2022-07-12 12:29:30,945 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 12:29:30,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 12:29:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 12:29:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 12:29:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2022-07-12 12:29:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2022-07-12 12:29:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:29:30,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 12:29:30,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2022-07-12 12:29:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_cmd_event_complete [2022-07-12 12:29:30,947 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_cmd_event_complete [2022-07-12 12:29:30,947 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_8 [2022-07-12 12:29:30,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_8 [2022-07-12 12:29:30,948 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 12:29:30,948 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec [2022-07-12 12:29:30,948 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec [2022-07-12 12:29:30,948 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_num [2022-07-12 12:29:30,948 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_num [2022-07-12 12:29:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-12 12:29:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-12 12:29:30,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2022-07-12 12:29:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 12:29:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 12:29:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 12:29:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2022-07-12 12:29:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 12:29:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-07-12 12:29:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2022-07-12 12:29:30,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_10 [2022-07-12 12:29:30,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_10 [2022-07-12 12:29:30,951 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-12 12:29:30,951 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-12 12:29:30,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2022-07-12 12:29:30,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2022-07-12 12:29:30,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2022-07-12 12:29:30,951 INFO L130 BoogieDeclarations]: Found specification of procedure mwifiex_usb_resume [2022-07-12 12:29:30,951 INFO L138 BoogieDeclarations]: Found implementation of procedure mwifiex_usb_resume [2022-07-12 12:29:30,952 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2022-07-12 12:29:30,952 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2022-07-12 12:29:30,953 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-07-12 12:29:30,954 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-07-12 12:29:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_u8 [2022-07-12 12:29:30,954 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-12 12:29:30,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-12 12:29:30,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 12:29:30,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 12:29:30,956 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_out [2022-07-12 12:29:30,956 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_out [2022-07-12 12:29:31,470 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 12:29:31,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 12:29:32,049 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 12:29:37,558 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2022-07-12 12:29:48,441 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 12:29:48,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 12:29:48,451 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 12:29:48,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:29:48 BoogieIcfgContainer [2022-07-12 12:29:48,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 12:29:48,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 12:29:48,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 12:29:48,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 12:29:48,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 12:29:28" (1/3) ... [2022-07-12 12:29:48,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf73fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:29:48, skipping insertion in model container [2022-07-12 12:29:48,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 12:29:30" (2/3) ... [2022-07-12 12:29:48,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bf73fc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 12:29:48, skipping insertion in model container [2022-07-12 12:29:48,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 12:29:48" (3/3) ... [2022-07-12 12:29:48,458 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--net--wireless--mwifiex--mwifiex_usb.ko-entry_point.cil.out.i [2022-07-12 12:29:48,467 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 12:29:48,467 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 12:29:48,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 12:29:48,538 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@4bc729c8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7fe33f89 [2022-07-12 12:29:48,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 12:29:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 855 states, 631 states have (on average 1.3851030110935023) internal successors, (874), 657 states have internal predecessors, (874), 180 states have call successors, (180), 44 states have call predecessors, (180), 42 states have return successors, (174), 166 states have call predecessors, (174), 174 states have call successors, (174) [2022-07-12 12:29:48,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 12:29:48,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:48,555 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:29:48,556 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash -967497407, now seen corresponding path program 1 times [2022-07-12 12:29:48,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:29:48,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193133072] [2022-07-12 12:29:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:48,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:29:48,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:29:48,576 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-12 12:29:48,579 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-12 12:29:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:49,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:29:49,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:29:49,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:29:49,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:29:49,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193133072] [2022-07-12 12:29:49,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193133072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:49,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:49,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:29:49,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111950068] [2022-07-12 12:29:49,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:49,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:29:49,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:29:49,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:29:49,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:29:49,321 INFO L87 Difference]: Start difference. First operand has 855 states, 631 states have (on average 1.3851030110935023) internal successors, (874), 657 states have internal predecessors, (874), 180 states have call successors, (180), 44 states have call predecessors, (180), 42 states have return successors, (174), 166 states have call predecessors, (174), 174 states have call successors, (174) Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:29:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:49,551 INFO L93 Difference]: Finished difference Result 1708 states and 2504 transitions. [2022-07-12 12:29:49,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:29:49,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-07-12 12:29:49,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:49,569 INFO L225 Difference]: With dead ends: 1708 [2022-07-12 12:29:49,569 INFO L226 Difference]: Without dead ends: 842 [2022-07-12 12:29:49,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:29:49,579 INFO L413 NwaCegarLoop]: 1217 mSDtfsCounter, 2 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:49,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3648 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:29:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-12 12:29:49,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 842. [2022-07-12 12:29:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 842 states, 626 states have (on average 1.3722044728434504) internal successors, (859), 644 states have internal predecessors, (859), 174 states have call successors, (174), 42 states have call predecessors, (174), 41 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2022-07-12 12:29:49,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 842 states to 842 states and 1202 transitions. [2022-07-12 12:29:49,685 INFO L78 Accepts]: Start accepts. Automaton has 842 states and 1202 transitions. Word has length 44 [2022-07-12 12:29:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:49,686 INFO L495 AbstractCegarLoop]: Abstraction has 842 states and 1202 transitions. [2022-07-12 12:29:49,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:29:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1202 transitions. [2022-07-12 12:29:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 12:29:49,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:49,688 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 12:29:49,711 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-12 12:29:49,911 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-12 12:29:49,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:49,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1457155709, now seen corresponding path program 1 times [2022-07-12 12:29:49,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:29:49,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754696297] [2022-07-12 12:29:49,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:49,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:29:49,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:29:49,919 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-12 12:29:49,920 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-12 12:29:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:50,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 12:29:50,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:29:50,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 12:29:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 12:29:50,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:29:50,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754696297] [2022-07-12 12:29:50,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754696297] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 12:29:50,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 12:29:50,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 12:29:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502281255] [2022-07-12 12:29:50,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 12:29:50,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 12:29:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:29:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 12:29:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 12:29:50,917 INFO L87 Difference]: Start difference. First operand 842 states and 1202 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-12 12:29:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:51,521 INFO L93 Difference]: Finished difference Result 1685 states and 2407 transitions. [2022-07-12 12:29:51,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 12:29:51,522 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-07-12 12:29:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:51,527 INFO L225 Difference]: With dead ends: 1685 [2022-07-12 12:29:51,527 INFO L226 Difference]: Without dead ends: 851 [2022-07-12 12:29:51,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2022-07-12 12:29:51,530 INFO L413 NwaCegarLoop]: 1199 mSDtfsCounter, 9 mSDsluCounter, 3592 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:51,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4791 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 12:29:51,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2022-07-12 12:29:51,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 851. [2022-07-12 12:29:51,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 634 states have (on average 1.3722397476340693) internal successors, (870), 652 states have internal predecessors, (870), 174 states have call successors, (174), 43 states have call predecessors, (174), 42 states have return successors, (169), 161 states have call predecessors, (169), 169 states have call successors, (169) [2022-07-12 12:29:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1213 transitions. [2022-07-12 12:29:51,564 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1213 transitions. Word has length 45 [2022-07-12 12:29:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:51,564 INFO L495 AbstractCegarLoop]: Abstraction has 851 states and 1213 transitions. [2022-07-12 12:29:51,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-07-12 12:29:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1213 transitions. [2022-07-12 12:29:51,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-12 12:29:51,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:51,568 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-12 12:29:51,600 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-12 12:29:51,779 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-12 12:29:51,779 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:51,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:51,780 INFO L85 PathProgramCache]: Analyzing trace with hash 726542785, now seen corresponding path program 2 times [2022-07-12 12:29:51,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:29:51,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854199444] [2022-07-12 12:29:51,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 12:29:51,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:29:51,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:29:51,782 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-12 12:29:51,783 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-12 12:29:52,183 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 12:29:52,183 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 12:29:52,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:29:52,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 12:29:52,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:29:52,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:29:52,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854199444] [2022-07-12 12:29:52,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854199444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:52,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:52,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 12:29:52,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610259713] [2022-07-12 12:29:52,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:52,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:29:52,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:29:52,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:29:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 12:29:52,294 INFO L87 Difference]: Start difference. First operand 851 states and 1213 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:29:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:52,675 INFO L93 Difference]: Finished difference Result 2456 states and 3510 transitions. [2022-07-12 12:29:52,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:29:52,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-07-12 12:29:52,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:52,685 INFO L225 Difference]: With dead ends: 2456 [2022-07-12 12:29:52,685 INFO L226 Difference]: Without dead ends: 1624 [2022-07-12 12:29:52,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-12 12:29:52,689 INFO L413 NwaCegarLoop]: 1387 mSDtfsCounter, 1122 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 2553 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:52,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 2553 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 12:29:52,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2022-07-12 12:29:52,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1624. [2022-07-12 12:29:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1208 states have (on average 1.3741721854304636) internal successors, (1660), 1240 states have internal predecessors, (1660), 332 states have call successors, (332), 84 states have call predecessors, (332), 83 states have return successors, (327), 311 states have call predecessors, (327), 327 states have call successors, (327) [2022-07-12 12:29:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2319 transitions. [2022-07-12 12:29:52,738 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2319 transitions. Word has length 48 [2022-07-12 12:29:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:52,738 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2319 transitions. [2022-07-12 12:29:52,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 12:29:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2319 transitions. [2022-07-12 12:29:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 12:29:52,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:52,740 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:29:52,756 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-12 12:29:52,953 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-12 12:29:52,953 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:52,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash 11952355, now seen corresponding path program 1 times [2022-07-12 12:29:52,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:29:52,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654841429] [2022-07-12 12:29:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:52,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:29:52,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:29:52,957 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-12 12:29:52,958 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-12 12:29:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:53,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 12:29:53,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 12:29:54,077 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:29:54,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:29:54,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654841429] [2022-07-12 12:29:54,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654841429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:54,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:54,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:29:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265133220] [2022-07-12 12:29:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:54,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:29:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:29:54,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:29:54,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:29:54,078 INFO L87 Difference]: Start difference. First operand 1624 states and 2319 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 12:29:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:56,082 INFO L93 Difference]: Finished difference Result 3576 states and 5163 transitions. [2022-07-12 12:29:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:29:56,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 65 [2022-07-12 12:29:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:56,096 INFO L225 Difference]: With dead ends: 3576 [2022-07-12 12:29:56,096 INFO L226 Difference]: Without dead ends: 1971 [2022-07-12 12:29:56,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:29:56,106 INFO L413 NwaCegarLoop]: 1655 mSDtfsCounter, 451 mSDsluCounter, 6103 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 7758 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:56,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 7758 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-12 12:29:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2022-07-12 12:29:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1624. [2022-07-12 12:29:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1208 states have (on average 1.3733443708609272) internal successors, (1659), 1240 states have internal predecessors, (1659), 332 states have call successors, (332), 84 states have call predecessors, (332), 83 states have return successors, (327), 311 states have call predecessors, (327), 327 states have call successors, (327) [2022-07-12 12:29:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2318 transitions. [2022-07-12 12:29:56,157 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2318 transitions. Word has length 65 [2022-07-12 12:29:56,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:56,158 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2318 transitions. [2022-07-12 12:29:56,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 12:29:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2318 transitions. [2022-07-12 12:29:56,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 12:29:56,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:56,162 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:29:56,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 12:29:56,363 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-12 12:29:56,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:56,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:56,364 INFO L85 PathProgramCache]: Analyzing trace with hash 230807073, now seen corresponding path program 1 times [2022-07-12 12:29:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:29:56,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270569245] [2022-07-12 12:29:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:29:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:29:56,367 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-12 12:29:56,369 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-12 12:29:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:29:57,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:29:57,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:29:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 12:29:58,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:29:58,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:29:58,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270569245] [2022-07-12 12:29:58,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270569245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:29:58,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:29:58,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 12:29:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019218002] [2022-07-12 12:29:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:29:58,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:29:58,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:29:58,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:29:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 12:29:58,707 INFO L87 Difference]: Start difference. First operand 1624 states and 2318 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:29:58,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:29:58,941 INFO L93 Difference]: Finished difference Result 4833 states and 7038 transitions. [2022-07-12 12:29:58,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:29:58,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 65 [2022-07-12 12:29:58,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:29:58,956 INFO L225 Difference]: With dead ends: 4833 [2022-07-12 12:29:58,957 INFO L226 Difference]: Without dead ends: 3228 [2022-07-12 12:29:58,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 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-12 12:29:58,962 INFO L413 NwaCegarLoop]: 1476 mSDtfsCounter, 1169 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1169 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:29:58,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1169 Valid, 2655 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:29:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3228 states. [2022-07-12 12:29:59,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3228 to 3218. [2022-07-12 12:29:59,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3218 states, 2397 states have (on average 1.3725490196078431) internal successors, (3290), 2457 states have internal predecessors, (3290), 655 states have call successors, (655), 166 states have call predecessors, (655), 165 states have return successors, (703), 618 states have call predecessors, (703), 650 states have call successors, (703) [2022-07-12 12:29:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3218 states to 3218 states and 4648 transitions. [2022-07-12 12:29:59,050 INFO L78 Accepts]: Start accepts. Automaton has 3218 states and 4648 transitions. Word has length 65 [2022-07-12 12:29:59,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:29:59,051 INFO L495 AbstractCegarLoop]: Abstraction has 3218 states and 4648 transitions. [2022-07-12 12:29:59,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:29:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 3218 states and 4648 transitions. [2022-07-12 12:29:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 12:29:59,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:29:59,053 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:29:59,082 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-12 12:29:59,266 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-12 12:29:59,267 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:29:59,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:29:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1435282055, now seen corresponding path program 1 times [2022-07-12 12:29:59,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:29:59,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562274243] [2022-07-12 12:29:59,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:29:59,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:29:59,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:29:59,269 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-12 12:29:59,270 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-12 12:30:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:00,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:30:00,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:01,518 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 12:30:01,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:01,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:01,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562274243] [2022-07-12 12:30:01,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562274243] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:01,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:01,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 12:30:01,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061546430] [2022-07-12 12:30:01,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:01,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:30:01,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:01,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:30:01,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 12:30:01,520 INFO L87 Difference]: Start difference. First operand 3218 states and 4648 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:30:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:01,858 INFO L93 Difference]: Finished difference Result 9607 states and 14192 transitions. [2022-07-12 12:30:01,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:30:01,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 66 [2022-07-12 12:30:01,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:01,884 INFO L225 Difference]: With dead ends: 9607 [2022-07-12 12:30:01,885 INFO L226 Difference]: Without dead ends: 6408 [2022-07-12 12:30:01,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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-12 12:30:01,895 INFO L413 NwaCegarLoop]: 1383 mSDtfsCounter, 1159 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1159 SdHoareTripleChecker+Valid, 2557 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:01,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1159 Valid, 2557 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:30:01,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6408 states. [2022-07-12 12:30:02,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6408 to 6399. [2022-07-12 12:30:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 4768 states have (on average 1.36996644295302) internal successors, (6532), 4884 states have internal predecessors, (6532), 1301 states have call successors, (1301), 330 states have call predecessors, (1301), 329 states have return successors, (1513), 1232 states have call predecessors, (1513), 1296 states have call successors, (1513) [2022-07-12 12:30:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 9346 transitions. [2022-07-12 12:30:02,064 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 9346 transitions. Word has length 66 [2022-07-12 12:30:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:02,066 INFO L495 AbstractCegarLoop]: Abstraction has 6399 states and 9346 transitions. [2022-07-12 12:30:02,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:30:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 9346 transitions. [2022-07-12 12:30:02,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 12:30:02,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:02,068 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:02,105 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-12 12:30:02,287 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-12 12:30:02,287 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1544432604, now seen corresponding path program 1 times [2022-07-12 12:30:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678353540] [2022-07-12 12:30:02,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:02,289 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:02,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:02,290 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-12 12:30:02,292 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-12 12:30:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:03,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 1256 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:30:03,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 12:30:03,934 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:03,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:03,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678353540] [2022-07-12 12:30:03,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678353540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:03,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:03,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 12:30:03,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602410703] [2022-07-12 12:30:03,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:03,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:30:03,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:30:03,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 12:30:03,935 INFO L87 Difference]: Start difference. First operand 6399 states and 9346 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:30:04,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:04,109 INFO L93 Difference]: Finished difference Result 6406 states and 9352 transitions. [2022-07-12 12:30:04,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:30:04,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 67 [2022-07-12 12:30:04,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:04,144 INFO L225 Difference]: With dead ends: 6406 [2022-07-12 12:30:04,145 INFO L226 Difference]: Without dead ends: 6403 [2022-07-12 12:30:04,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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-12 12:30:04,151 INFO L413 NwaCegarLoop]: 1385 mSDtfsCounter, 1156 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 2558 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:04,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 2558 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:30:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2022-07-12 12:30:04,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6400. [2022-07-12 12:30:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6400 states, 4769 states have (on average 1.3698888655902706) internal successors, (6533), 4885 states have internal predecessors, (6533), 1301 states have call successors, (1301), 330 states have call predecessors, (1301), 329 states have return successors, (1513), 1232 states have call predecessors, (1513), 1296 states have call successors, (1513) [2022-07-12 12:30:04,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6400 states to 6400 states and 9347 transitions. [2022-07-12 12:30:04,354 INFO L78 Accepts]: Start accepts. Automaton has 6400 states and 9347 transitions. Word has length 67 [2022-07-12 12:30:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:04,354 INFO L495 AbstractCegarLoop]: Abstraction has 6400 states and 9347 transitions. [2022-07-12 12:30:04,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:30:04,355 INFO L276 IsEmpty]: Start isEmpty. Operand 6400 states and 9347 transitions. [2022-07-12 12:30:04,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-12 12:30:04,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:04,357 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:04,386 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-12 12:30:04,563 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-12 12:30:04,563 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash -633127460, now seen corresponding path program 1 times [2022-07-12 12:30:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:04,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [432676702] [2022-07-12 12:30:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:04,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:04,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:04,566 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-12 12:30:04,566 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-12 12:30:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:05,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 1257 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:30:05,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 12:30:06,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:06,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:06,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [432676702] [2022-07-12 12:30:06,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [432676702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:06,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:06,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 12:30:06,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467667185] [2022-07-12 12:30:06,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:06,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:30:06,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:06,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:30:06,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 12:30:06,160 INFO L87 Difference]: Start difference. First operand 6400 states and 9347 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:30:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:06,253 INFO L93 Difference]: Finished difference Result 6402 states and 9348 transitions. [2022-07-12 12:30:06,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:30:06,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 68 [2022-07-12 12:30:06,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:06,287 INFO L225 Difference]: With dead ends: 6402 [2022-07-12 12:30:06,287 INFO L226 Difference]: Without dead ends: 6399 [2022-07-12 12:30:06,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-12 12:30:06,292 INFO L413 NwaCegarLoop]: 1197 mSDtfsCounter, 1145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:06,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 1197 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:30:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6399 states. [2022-07-12 12:30:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6399 to 6399. [2022-07-12 12:30:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 4769 states have (on average 1.369679178024743) internal successors, (6532), 4884 states have internal predecessors, (6532), 1300 states have call successors, (1300), 330 states have call predecessors, (1300), 329 states have return successors, (1513), 1232 states have call predecessors, (1513), 1296 states have call successors, (1513) [2022-07-12 12:30:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 9345 transitions. [2022-07-12 12:30:06,499 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 9345 transitions. Word has length 68 [2022-07-12 12:30:06,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:06,500 INFO L495 AbstractCegarLoop]: Abstraction has 6399 states and 9345 transitions. [2022-07-12 12:30:06,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:30:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 9345 transitions. [2022-07-12 12:30:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 12:30:06,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:06,503 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:06,532 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-12 12:30:06,715 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-12 12:30:06,716 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:06,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1847533095, now seen corresponding path program 1 times [2022-07-12 12:30:06,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:06,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172884362] [2022-07-12 12:30:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:06,717 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:06,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:06,718 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-12 12:30:06,719 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-12 12:30:07,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:07,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:30:07,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 12:30:08,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:08,378 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:08,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172884362] [2022-07-12 12:30:08,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172884362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:08,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:08,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 12:30:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538850075] [2022-07-12 12:30:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:08,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:30:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:08,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:30:08,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 12:30:08,379 INFO L87 Difference]: Start difference. First operand 6399 states and 9345 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:30:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:08,463 INFO L93 Difference]: Finished difference Result 6401 states and 9346 transitions. [2022-07-12 12:30:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:30:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 69 [2022-07-12 12:30:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:08,516 INFO L225 Difference]: With dead ends: 6401 [2022-07-12 12:30:08,516 INFO L226 Difference]: Without dead ends: 6369 [2022-07-12 12:30:08,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-12 12:30:08,521 INFO L413 NwaCegarLoop]: 1196 mSDtfsCounter, 1142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1196 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-12 12:30:08,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 12:30:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2022-07-12 12:30:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 6369. [2022-07-12 12:30:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6369 states, 4742 states have (on average 1.3694643610291017) internal successors, (6494), 4856 states have internal predecessors, (6494), 1297 states have call successors, (1297), 330 states have call predecessors, (1297), 329 states have return successors, (1508), 1230 states have call predecessors, (1508), 1294 states have call successors, (1508) [2022-07-12 12:30:08,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6369 states to 6369 states and 9299 transitions. [2022-07-12 12:30:08,746 INFO L78 Accepts]: Start accepts. Automaton has 6369 states and 9299 transitions. Word has length 69 [2022-07-12 12:30:08,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:08,747 INFO L495 AbstractCegarLoop]: Abstraction has 6369 states and 9299 transitions. [2022-07-12 12:30:08,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 12:30:08,747 INFO L276 IsEmpty]: Start isEmpty. Operand 6369 states and 9299 transitions. [2022-07-12 12:30:08,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 12:30:08,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:08,761 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2022-07-12 12:30:08,808 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-12 12:30:08,987 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-12 12:30:08,987 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:08,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1553347695, now seen corresponding path program 1 times [2022-07-12 12:30:08,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:08,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113216383] [2022-07-12 12:30:08,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:08,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:08,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:08,991 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-12 12:30:09,011 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-12 12:30:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:10,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 1373 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:30:10,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 12:30:10,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:10,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:10,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113216383] [2022-07-12 12:30:10,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113216383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:10,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:10,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 12:30:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383547055] [2022-07-12 12:30:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:10,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:30:10,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:30:10,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 12:30:10,131 INFO L87 Difference]: Start difference. First operand 6369 states and 9299 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 12:30:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:10,997 INFO L93 Difference]: Finished difference Result 17378 states and 25193 transitions. [2022-07-12 12:30:10,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:30:10,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 102 [2022-07-12 12:30:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:11,032 INFO L225 Difference]: With dead ends: 17378 [2022-07-12 12:30:11,032 INFO L226 Difference]: Without dead ends: 11026 [2022-07-12 12:30:11,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 100 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-12 12:30:11,051 INFO L413 NwaCegarLoop]: 1603 mSDtfsCounter, 872 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:11,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 2752 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 12:30:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11026 states. [2022-07-12 12:30:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11026 to 10995. [2022-07-12 12:30:11,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10995 states, 8148 states have (on average 1.359720176730486) internal successors, (11079), 8361 states have internal predecessors, (11079), 2224 states have call successors, (2224), 623 states have call predecessors, (2224), 622 states have return successors, (2573), 2098 states have call predecessors, (2573), 2221 states have call successors, (2573) [2022-07-12 12:30:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10995 states to 10995 states and 15876 transitions. [2022-07-12 12:30:11,377 INFO L78 Accepts]: Start accepts. Automaton has 10995 states and 15876 transitions. Word has length 102 [2022-07-12 12:30:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:11,378 INFO L495 AbstractCegarLoop]: Abstraction has 10995 states and 15876 transitions. [2022-07-12 12:30:11,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 12:30:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 10995 states and 15876 transitions. [2022-07-12 12:30:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-12 12:30:11,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:11,384 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 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] [2022-07-12 12:30:11,411 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-12 12:30:11,590 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-12 12:30:11,590 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1390336057, now seen corresponding path program 1 times [2022-07-12 12:30:11,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:11,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810357382] [2022-07-12 12:30:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:11,592 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:11,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:11,600 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-12 12:30:11,601 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-12 12:30:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:12,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 12:30:12,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-07-12 12:30:12,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:12,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:12,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810357382] [2022-07-12 12:30:12,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810357382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:12,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:12,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:30:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132047402] [2022-07-12 12:30:12,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:12,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:30:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:12,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:30:12,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:30:12,929 INFO L87 Difference]: Start difference. First operand 10995 states and 15876 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 12:30:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:13,739 INFO L93 Difference]: Finished difference Result 17890 states and 25738 transitions. [2022-07-12 12:30:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:30:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 128 [2022-07-12 12:30:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:13,763 INFO L225 Difference]: With dead ends: 17890 [2022-07-12 12:30:13,764 INFO L226 Difference]: Without dead ends: 6911 [2022-07-12 12:30:13,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:30:13,836 INFO L413 NwaCegarLoop]: 1194 mSDtfsCounter, 38 mSDsluCounter, 3573 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 4767 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:13,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 4767 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 12:30:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6911 states. [2022-07-12 12:30:13,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6911 to 6795. [2022-07-12 12:30:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6795 states, 5036 states have (on average 1.3534551231135823) internal successors, (6816), 5171 states have internal predecessors, (6816), 1362 states have call successors, (1362), 397 states have call predecessors, (1362), 396 states have return successors, (1549), 1280 states have call predecessors, (1549), 1359 states have call successors, (1549) [2022-07-12 12:30:14,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6795 states to 6795 states and 9727 transitions. [2022-07-12 12:30:14,007 INFO L78 Accepts]: Start accepts. Automaton has 6795 states and 9727 transitions. Word has length 128 [2022-07-12 12:30:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:14,008 INFO L495 AbstractCegarLoop]: Abstraction has 6795 states and 9727 transitions. [2022-07-12 12:30:14,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-07-12 12:30:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6795 states and 9727 transitions. [2022-07-12 12:30:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 12:30:14,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:14,014 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2022-07-12 12:30:14,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 12:30:14,227 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-12 12:30:14,227 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:14,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1851619390, now seen corresponding path program 1 times [2022-07-12 12:30:14,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:14,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883116195] [2022-07-12 12:30:14,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:14,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:14,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:14,230 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-12 12:30:14,232 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-12 12:30:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:15,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 12:30:15,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-07-12 12:30:15,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:15,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:15,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883116195] [2022-07-12 12:30:15,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883116195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:15,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:15,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 12:30:15,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830086657] [2022-07-12 12:30:15,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:15,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 12:30:15,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:15,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 12:30:15,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 12:30:15,580 INFO L87 Difference]: Start difference. First operand 6795 states and 9727 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 12:30:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:17,253 INFO L93 Difference]: Finished difference Result 12476 states and 17885 transitions. [2022-07-12 12:30:17,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 12:30:17,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 134 [2022-07-12 12:30:17,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:17,307 INFO L225 Difference]: With dead ends: 12476 [2022-07-12 12:30:17,308 INFO L226 Difference]: Without dead ends: 6809 [2022-07-12 12:30:17,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 12:30:17,318 INFO L413 NwaCegarLoop]: 1444 mSDtfsCounter, 435 mSDsluCounter, 5231 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 6675 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:17,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 6675 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 12:30:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2022-07-12 12:30:17,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 6795. [2022-07-12 12:30:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6795 states, 5036 states have (on average 1.3526608419380461) internal successors, (6812), 5171 states have internal predecessors, (6812), 1362 states have call successors, (1362), 397 states have call predecessors, (1362), 396 states have return successors, (1549), 1280 states have call predecessors, (1549), 1359 states have call successors, (1549) [2022-07-12 12:30:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6795 states to 6795 states and 9723 transitions. [2022-07-12 12:30:17,492 INFO L78 Accepts]: Start accepts. Automaton has 6795 states and 9723 transitions. Word has length 134 [2022-07-12 12:30:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:17,492 INFO L495 AbstractCegarLoop]: Abstraction has 6795 states and 9723 transitions. [2022-07-12 12:30:17,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-07-12 12:30:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 6795 states and 9723 transitions. [2022-07-12 12:30:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-12 12:30:17,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:17,498 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2022-07-12 12:30:17,534 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-12 12:30:17,707 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-12 12:30:17,708 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:17,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:17,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1774718592, now seen corresponding path program 1 times [2022-07-12 12:30:17,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:17,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134920316] [2022-07-12 12:30:17,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:17,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:17,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:17,711 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-12 12:30:17,712 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-12 12:30:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:19,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 1499 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 12:30:19,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 12:30:19,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:19,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:19,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134920316] [2022-07-12 12:30:19,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134920316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:19,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:19,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 12:30:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581954517] [2022-07-12 12:30:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:19,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 12:30:19,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:19,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 12:30:19,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:30:19,576 INFO L87 Difference]: Start difference. First operand 6795 states and 9723 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:30:19,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:19,823 INFO L93 Difference]: Finished difference Result 12514 states and 18007 transitions. [2022-07-12 12:30:19,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 12:30:19,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 134 [2022-07-12 12:30:19,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:19,848 INFO L225 Difference]: With dead ends: 12514 [2022-07-12 12:30:19,848 INFO L226 Difference]: Without dead ends: 6847 [2022-07-12 12:30:19,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:30:19,862 INFO L413 NwaCegarLoop]: 1203 mSDtfsCounter, 4 mSDsluCounter, 3588 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:19,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4791 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 12:30:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6847 states. [2022-07-12 12:30:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6847 to 6829. [2022-07-12 12:30:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6829 states, 5060 states have (on average 1.3517786561264822) internal successors, (6840), 5197 states have internal predecessors, (6840), 1366 states have call successors, (1366), 397 states have call predecessors, (1366), 402 states have return successors, (1589), 1288 states have call predecessors, (1589), 1363 states have call successors, (1589) [2022-07-12 12:30:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6829 states to 6829 states and 9795 transitions. [2022-07-12 12:30:20,075 INFO L78 Accepts]: Start accepts. Automaton has 6829 states and 9795 transitions. Word has length 134 [2022-07-12 12:30:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:20,075 INFO L495 AbstractCegarLoop]: Abstraction has 6829 states and 9795 transitions. [2022-07-12 12:30:20,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 12:30:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 6829 states and 9795 transitions. [2022-07-12 12:30:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 12:30:20,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:20,081 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 12:30:20,117 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-12 12:30:20,295 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-12 12:30:20,295 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:20,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:20,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1437416734, now seen corresponding path program 1 times [2022-07-12 12:30:20,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:20,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289024046] [2022-07-12 12:30:20,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:20,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:20,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:20,298 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-12 12:30:20,299 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-12 12:30:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:21,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 1643 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 12:30:21,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:21,470 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-12 12:30:21,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:21,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:21,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289024046] [2022-07-12 12:30:21,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289024046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:21,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:21,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 12:30:21,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251068829] [2022-07-12 12:30:21,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:21,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 12:30:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 12:30:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 12:30:21,472 INFO L87 Difference]: Start difference. First operand 6829 states and 9795 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 12:30:21,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:21,827 INFO L93 Difference]: Finished difference Result 16616 states and 23824 transitions. [2022-07-12 12:30:21,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 12:30:21,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 138 [2022-07-12 12:30:21,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:21,859 INFO L225 Difference]: With dead ends: 16616 [2022-07-12 12:30:21,859 INFO L226 Difference]: Without dead ends: 9427 [2022-07-12 12:30:21,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 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-12 12:30:21,878 INFO L413 NwaCegarLoop]: 1748 mSDtfsCounter, 897 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 2902 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:21,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 2902 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 12:30:21,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9427 states. [2022-07-12 12:30:22,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9427 to 9304. [2022-07-12 12:30:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9304 states, 6922 states have (on average 1.3550996821727825) internal successors, (9380), 7116 states have internal predecessors, (9380), 1814 states have call successors, (1814), 556 states have call predecessors, (1814), 567 states have return successors, (2172), 1693 states have call predecessors, (2172), 1811 states have call successors, (2172) [2022-07-12 12:30:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9304 states to 9304 states and 13366 transitions. [2022-07-12 12:30:22,150 INFO L78 Accepts]: Start accepts. Automaton has 9304 states and 13366 transitions. Word has length 138 [2022-07-12 12:30:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:22,151 INFO L495 AbstractCegarLoop]: Abstraction has 9304 states and 13366 transitions. [2022-07-12 12:30:22,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 12:30:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 9304 states and 13366 transitions. [2022-07-12 12:30:22,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-12 12:30:22,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:22,155 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2022-07-12 12:30:22,184 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-12 12:30:22,381 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-12 12:30:22,381 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:22,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1581890694, now seen corresponding path program 1 times [2022-07-12 12:30:22,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:22,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273016788] [2022-07-12 12:30:22,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:22,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:22,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:22,385 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-12 12:30:22,387 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-12 12:30:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:23,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 1516 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 12:30:23,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 12:30:24,900 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:24,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:24,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273016788] [2022-07-12 12:30:24,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273016788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:24,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:24,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 12:30:24,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124959362] [2022-07-12 12:30:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:24,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 12:30:24,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:24,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 12:30:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-12 12:30:24,902 INFO L87 Difference]: Start difference. First operand 9304 states and 13366 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 12:30:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:31,989 INFO L93 Difference]: Finished difference Result 21756 states and 31871 transitions. [2022-07-12 12:30:31,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 12:30:31,990 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) Word has length 140 [2022-07-12 12:30:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:32,031 INFO L225 Difference]: With dead ends: 21756 [2022-07-12 12:30:32,031 INFO L226 Difference]: Without dead ends: 12497 [2022-07-12 12:30:32,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-07-12 12:30:32,052 INFO L413 NwaCegarLoop]: 2341 mSDtfsCounter, 2563 mSDsluCounter, 20376 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2647 SdHoareTripleChecker+Valid, 22717 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:32,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2647 Valid, 22717 Invalid, 1042 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [203 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-12 12:30:32,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12497 states. [2022-07-12 12:30:32,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12497 to 9288. [2022-07-12 12:30:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9288 states, 6906 states have (on average 1.3540399652476107) internal successors, (9351), 7101 states have internal predecessors, (9351), 1814 states have call successors, (1814), 556 states have call predecessors, (1814), 567 states have return successors, (2172), 1692 states have call predecessors, (2172), 1811 states have call successors, (2172) [2022-07-12 12:30:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9288 states to 9288 states and 13337 transitions. [2022-07-12 12:30:32,416 INFO L78 Accepts]: Start accepts. Automaton has 9288 states and 13337 transitions. Word has length 140 [2022-07-12 12:30:32,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:32,417 INFO L495 AbstractCegarLoop]: Abstraction has 9288 states and 13337 transitions. [2022-07-12 12:30:32,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 9 states have internal predecessors, (92), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 5 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-12 12:30:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 9288 states and 13337 transitions. [2022-07-12 12:30:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-12 12:30:32,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:32,423 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 12:30:32,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 12:30:32,634 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-12 12:30:32,634 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:32,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1703720375, now seen corresponding path program 1 times [2022-07-12 12:30:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:32,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047875084] [2022-07-12 12:30:32,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:32,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:32,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:32,637 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-12 12:30:32,638 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-12 12:30:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 12:30:34,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 12:30:34,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 12:30:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-12 12:30:34,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 12:30:34,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 12:30:34,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047875084] [2022-07-12 12:30:34,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047875084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 12:30:34,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 12:30:34,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 12:30:34,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435473053] [2022-07-12 12:30:34,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 12:30:34,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 12:30:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 12:30:34,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 12:30:34,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 12:30:34,098 INFO L87 Difference]: Start difference. First operand 9288 states and 13337 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-12 12:30:34,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 12:30:34,805 INFO L93 Difference]: Finished difference Result 23965 states and 35282 transitions. [2022-07-12 12:30:34,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 12:30:34,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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 161 [2022-07-12 12:30:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 12:30:34,923 INFO L225 Difference]: With dead ends: 23965 [2022-07-12 12:30:34,923 INFO L226 Difference]: Without dead ends: 14722 [2022-07-12 12:30:34,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 12:30:34,941 INFO L413 NwaCegarLoop]: 1799 mSDtfsCounter, 1094 mSDsluCounter, 2989 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 4788 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 12:30:34,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 4788 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 12:30:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14722 states. [2022-07-12 12:30:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14722 to 9304. [2022-07-12 12:30:35,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9304 states, 6922 states have (on average 1.3532216122507945) internal successors, (9367), 7117 states have internal predecessors, (9367), 1814 states have call successors, (1814), 556 states have call predecessors, (1814), 567 states have return successors, (2172), 1692 states have call predecessors, (2172), 1811 states have call successors, (2172) [2022-07-12 12:30:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9304 states to 9304 states and 13353 transitions. [2022-07-12 12:30:35,329 INFO L78 Accepts]: Start accepts. Automaton has 9304 states and 13353 transitions. Word has length 161 [2022-07-12 12:30:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 12:30:35,330 INFO L495 AbstractCegarLoop]: Abstraction has 9304 states and 13353 transitions. [2022-07-12 12:30:35,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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-12 12:30:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 9304 states and 13353 transitions. [2022-07-12 12:30:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-12 12:30:35,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 12:30:35,335 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2022-07-12 12:30:35,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 12:30:35,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 12:30:35,543 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 12:30:35,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 12:30:35,543 INFO L85 PathProgramCache]: Analyzing trace with hash 436590142, now seen corresponding path program 1 times [2022-07-12 12:30:35,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 12:30:35,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898438533] [2022-07-12 12:30:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 12:30:35,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 12:30:35,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 12:30:35,546 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 12:30:35,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process